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

The peak-to-average power ratio PAPR(𝒞) of a code 𝒞 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(𝒞)) 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 8logn. We give explicit constructions of error-correcting codes with low PAPR by employing bounds for hybrid exponential sums over Galois fields and rings