Space Time Codes from Permutation Codes
| dc.creator | Henkel, Oliver | |
| dc.date | 2007-04-24 | |
| dc.date.accessioned | 2026-07-07T08:15:58Z | |
| dc.date.available | 2026-07-07T08:15:58Z | |
| dc.description | A new class of space time codes with high performance is presented. The code design utilizes tailor-made permutation codes, which are known to have large minimal distances as spherical codes. A geometric connection between spherical and space time codes has been used to translate them into the final space time codes. Simulations demonstrate that the performance increases with the block lengths, a result that has been conjectured already in previous work. Further, the connection to permutation codes allows for moderate complex en-/decoding algorithms. | |
| dc.identifier | https://arxiv.org/abs/0704.3120 | |
| dc.identifier | http://arxiv.org/abs/0704.3120 | |
| dc.identifier | Proc. IEEE GlobeCom, San Francisco, California, Nov. 2006 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133626 | |
| dc.subject | Information Theory | |
| dc.title | Space Time Codes from Permutation Codes | |
| dc.type | text |