Dentist 2:00On codes with low peak-to-average power ratio for multicode CDMA

Codes which reduce the peak-to-average power (PAPR) in multicode code-division multiple-access (MC-CDMA) communications systems are systematically studied. The problem of designing such codes is reformulated as a new coding-theoretic problem: codes with low PAPR are ones in which the codewords are far from the first-order Reed-Muller code. Bounds on the tradeoff between rate, PAPR, and error-correcting capability of codes for MC-CDMA follow. The connections between the code design problem, bent functions, and algebraic coding theory (in particular, the Kerdock codes and Delsarte-Goethals codes) are exploited to construct code families with flexible parameters for the small values of n of practical interest. In view of their algebraic structure, these codes enjoy efficient encoding and decoding algorithms. The correspondence concludes by listing open problems in algebraic coding theory and Boolean functions motivated by the correspondence.

[1]  Claude Carlet,et al.  A characterization of binary bent functions , 1997, Proceedings of IEEE International Symposium on Information Theory.

[2]  T. Wilkinson,et al.  Block coding scheme for reduction of peak to mean envelope power ratio of multicarrier transmission schemes , 1994 .

[3]  Vijay K. Bhargava,et al.  Recent advances in cellular wireless communications , 1999, IEEE Commun. Mag..

[4]  N. J. A. Sloane,et al.  The Z4-linearity of Kerdock, Preparata, Goethals, and related codes , 1994, IEEE Trans. Inf. Theory.

[5]  Anne Canteaut,et al.  On cryptographic properties of the cosets of R(1, m) , 2001, IEEE Trans. Inf. Theory.

[6]  Tony Ottosson.  Precoding in multicode DS-CDMA systems , 1997, Proceedings of IEEE International Symposium on Information Theory.

[7]  I Chih-Lin,et al.  Multi-code CDMA wireless personal communications networks , 1995, Proceedings IEEE International Conference on Communications ICC '95.

[8]  E-L. Kuan,et al.  Overview of Multicarrier CDMA , 2004 .

[9]  T. Wada.  Characteristic of Bit Sequences Applicable to Constant Amplitude Orthogonal Multicode System , 2000 .

[10]  Anne Canteaut,et al.  Binary m-sequences with three-valued crosscorrelation: A proof of Welch's conjecture , 2000, IEEE Trans. Inf. Theory.

[11]  Tony Ottosson.  Precoding for Minimization of Envelope Variations in Multicode DS-CDMA Systems , 2000, Wirel. Pers. Commun..

[12]  R.D.J. van Nee,et al.  OFDM codes for peak-to-average power reduction and error correction , 1996 .

[13]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[14]  R. Neil Braithwaite.  Using Walsh code selection to reduce the power variance of band-limited forward-link CDMA waveforms , 2000, IEEE Journal on Selected Areas in Communications.

[15]  P. V. Kumar,et al.  The &-Linearity of Kerdcck , Preparata , Goethals , and Related Codes , 2022 .

[16]  Xiang-dong Hou.  Cubic bent functions , 1998, Discret. Math..

[17]  C. Tellambura,et al.  A construction for binary sequence sets with low peak-to-average power ratio , 2002, Proceedings IEEE International Symposium on Information Theory,.

[18]  T. Wada,et al.  A constant amplitude coding for orthogonal multi-code CDMA systems , 1997 .

[19]  Johannes Mykkeltveit.  The covering radius of the (128, 8) Reed-Muller code is 56 (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[20]  Carlisle Adams,et al.  Generating and counting binary bent sequences , 1990, IEEE Trans. Inf. Theory.

[21]  Anne Canteaut.  On the weight distributions of optimal cosets of the first-order Reed-Muller codes , 2001, IEEE Trans. Inf. Theory.

[22]  Kenneth G. Paterson,et al.  Generalized Reed-Muller codes and power control in OFDM modulation , 1998, IEEE Trans. Inf. Theory.

[23]  Patrick Solé,et al.  Asymptotic bounds on the covering radius of binary codes , 1990, IEEE Trans. Inf. Theory.

[24]  Xiang-dong Hou.  Covering Radius of the Reed-Muller CodeR(1, 7) - A Simpler Proof , 1996, J. Comb. Theory, Ser. A.

[25]  Stephan ten Brink,et al.  IS-95 enhancements for multimedia services , 1996, Bell Labs Technical Journal.

[26]  Kaisa Nyberg,et al.  Constructions of Bent Functions and Difference Sets , 1991, EUROCRYPT.

[27]  Timo Neumann,et al.  BENT FUNCTIONS , 2006 .

[28]  Sanjiv Nanda,et al.  Adaptation techniques in wireless packet data services , 2000, IEEE Commun. Mag..

[29]  Claude Carlet,et al.  Codes, Bent Functions and Permutations Suitable For DES-like Cryptosystems , 1998, Des. Codes Cryptogr..

[30]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[31]  Jacques Wolfmann,et al.  Bent Functions and Coding Theory , 1999 .

[32]  Kenneth G. Paterson,et al.  Efficient Decoding Algorithms for Generalised Reed-Muller Codes , 1998 .

[33]  K. Paterson,et al.  On the existence and construction of good codes with low peak-to-average power ratios , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).

[34]  A. Pott,et al.  Difference sets, sequences and their correlation properties , 1999 .

[35]  Takaya Yamazato,et al.  Error Correcting Capability of Constant Amplitude Coding for Orthogonal Multi-Code CDMA Systems (Special Section on Information Theory and Its Applications) , 1998 .

[36]  Vincent K. N. Lau.  On the analysis of peak-to-average ratio (PAR) for IS95 and CDMA2000 systems , 2000, IEEE Trans. Veh. Technol..

[37]  Claude Carlet,et al.  An Alternate Characterization of the Bentness of Binary Functions, with Uniqueness , 1998, Des. Codes Cryptogr..

[38]  H. Imai,et al.  Block Coding Scheme Based on Complementary Sequences for Multicarrier Signals , 1997 .

[39]  Nicholas J. Patterson,et al.  The covering radius of the (215, 16) Reed-Muller code is at least 16276 , 1983, IEEE Trans. Inf. Theory.

[40]  Willi Meier,et al.  Nonlinearity Criteria for Cryptographic Functions , 1990, EUROCRYPT.

[41]  Hans Dobbertin,et al.  Construction of Bent Functions and Balanced Boolean Functions with High Nonlinearity , 1994, FSE.

[42]  H. Hollmann,et al.  A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences , 2001 .

[43]  Tor Helleseth,et al.  On the covering radius of binary codes (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[44]  James A. Davis,et al.  Peak-to-mean power control in OFDM, Golay complementary sequences and Reed-Muller codes , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).

[45]  Claude Carlet,et al.  Propagation Characteristics of Boolean Functions , 2005, Encyclopedia of Cryptography and Security.

[46]  Jonathan Jedwab,et al.  Peak-to-mean power control and error correction for OFDM transmission using Golay sequences and Reed-Muller codes , 1997 .

[47]  Kenneth G. Paterson,et al.  On the existence and construction of good codes with low peak-to-average power ratios , 2000, IEEE Trans. Inf. Theory.