Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
Proceedings of the 8th IMA International Conference on Cryptography and Coding
Group Representation Design of Digital Signals and Sequences
SETA '08 Proceedings of the 5th international conference on Sequences and Their Applications
Reed-Solomon codes implementing a coded single-carrier with cyclic prefix scheme
IEEE Transactions on Communications
Peak power reduction of OFDM signals with sign adjustment
IEEE Transactions on Communications
Bent functions and codes with low peak-to-average power ratio for multi-code CDMA
AAECC'07 Proceedings of the 17th international conference on Applied algebra, algebraic algorithms and error-correcting codes
Galois rings and pseudo-random sequences
Cryptography and Coding'07 Proceedings of the 11th IMA international conference on Cryptography and coding
Sequences for phase-encoded optical CDMA
SSC'07 Proceedings of the 2007 international conference on Sequences, subsequences, and consequences
A theoretical treatment of PA power optimization in clipped MIMO-OFDM systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Construction of M-QAM sequences based on generalized Rudin-Shapiro polynomials
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Successive PAR reduction in (MIMO) OFDM
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Asymptotic performance analysis and successive selected mapping for PAR reduction in OFDM
IEEE Transactions on Signal Processing
Bounds on the PMEPR of translates of binary codes
IEEE Communications Letters
A new construction of 16-QAM near complementary sequences
IEEE Transactions on Information Theory
Constant envelope binary OFDM phase modulation
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Weighted degree trace codes for PAPR reduction
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
On the peak-to-average power ratio of M-sequences
Finite Fields and Their Applications
| Hi-index | 754.90 |
The first lower bound on the peak-to-average power ratio (PAPR) of a constant energy code of a given length n, minimum Euclidean distance and rate is established. Conversely, using a nonconstructive Varshamov-Gilbert style argument yields a lower bound on the achievable rate of a code of a given length, minimum Euclidean distance and maximum PAPR. The derivation of these bounds relies on a geometrical analysis of the PAPR of such a code. Further analysis shows that there exist asymptotically good codes whose PAPR is at most 8 log n. These bounds motivate the explicit construction of error-correcting codes with low PAPR. Bounds for exponential sums over Galois fields and rings are applied to obtain an upper bound of order (log n)2 on the PAPRs of a constructive class of codes, the trace codes. This class includes the binary simplex code, duals of binary, primitive Bose-Chaudhuri-Hocquenghem (BCH) codes and a variety of their nonbinary analogs. Some open problems are identified