Published October 22, 2006
| Published
Book Section - Chapter
Open
On the Optimality of the Golden Code
- Creators
- Oggier, Frédérique
Abstract
In this note, we prove the optimality of the Golden Code inside the class of cyclic algebras based codes. In doing so, we get better insight on these algebraic codes, not only in dimension 2, but more generally for higher dimension, and summarizing the different approaches tried so far to optimize them, we derive design strategies that we believe are the key to either show the optimality of existing codes or give a way to improve them.
Additional Information
© 2006 IEEE. The author would like to thank Prof. E. Viterbo for his careful reading of this note, and Dr. J. Lahtonen for sending a preprint of his work. This work was supported by the Swiss National Science Foundation grant PBEL2-110209, and by NSF grant CCR-0133818, by Caltech's Lee Center for Advanced Networking and by a grant from the David and Lucille Packard Foundation.Attached Files
Published - OGGitw06a.pdf
Files
OGGitw06a.pdf
Files
(199.4 kB)
Name | Size | Download all |
---|---|---|
md5:fb1d631b357a68bd7c8f6f711a73faae
|
199.4 kB | Preview Download |
Additional details
- Eprint ID
- 17778
- Resolver ID
- CaltechAUTHORS:20100319-095515443
- PBEL2-110209
- Swiss National Science Foundation (SNSF)
- CCR-0133818
- NSF
- Caltech's Lee Center for Advanced Networking
- David and Lucile Packard Foundation
- Created
-
2010-03-31Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field