On the existence and construction of good codes with lowpeak-to-average power ratios

摘要

The peak-to-average power ratio PAPR(𝒞) of a code 𝒞 isan important characteristic of that code when it is used in OFDMcommunications. We establish bounds on the region of achievable triples(R, d, PAPR(𝒞)) where R is the code rate and d is the minimumEuclidean distance of the code. We prove a lower bound on PAPR in termsof R and d and show that there exist asymptotically good codes whosePAPR is at most 8logn. We give explicit constructions oferror-correcting codes with low PAPR by employing bounds for hybridexponential sums over Galois fields and rings