On the existence and construction of good codes with low peak-to-average power ratios
Publication
, Conference
Paterson, KG; Tarokh, V
Published in: IEEE International Symposium on Information Theory - Proceedings
December 1, 2000
The peak-to-average power ratio PAPR(C) of a code C is an important characteristic of that code when it is used in OFDM communications. We establish bounds on the region of achievable triples (R, d, PAPR(C)) where R is the code rate and d is the minimum Euclidean distance of the code. We prove a lower bound on PAPR in terms of R and d and show that there exist asymptotically good codes whose PAPR is at most 8 log n. We give explicit constructions of error-correcting codes with low PAPR by employing bounds for hybrid exponential sums over Galois fields and rings.
Duke Scholars
Published In
IEEE International Symposium on Information Theory - Proceedings
ISSN
2157-8095
Publication Date
December 1, 2000
Start / End Page
217
Citation
APA
Chicago
ICMJE
MLA
NLM
Paterson, K. G., & Tarokh, V. (2000). On the existence and construction of good codes with low peak-to-average power ratios. In IEEE International Symposium on Information Theory - Proceedings (p. 217).
Paterson, K. G., and V. Tarokh. “On the existence and construction of good codes with low peak-to-average power ratios.” In IEEE International Symposium on Information Theory - Proceedings, 217, 2000.
Paterson KG, Tarokh V. On the existence and construction of good codes with low peak-to-average power ratios. In: IEEE International Symposium on Information Theory - Proceedings. 2000. p. 217.
Paterson, K. G., and V. Tarokh. “On the existence and construction of good codes with low peak-to-average power ratios.” IEEE International Symposium on Information Theory - Proceedings, 2000, p. 217.
Paterson KG, Tarokh V. On the existence and construction of good codes with low peak-to-average power ratios. IEEE International Symposium on Information Theory - Proceedings. 2000. p. 217.
Published In
IEEE International Symposium on Information Theory - Proceedings
ISSN
2157-8095
Publication Date
December 1, 2000
Start / End Page
217