Synthesis Method for Families of Constant Amplitude Correcting Codes Based on an Arbitrary Bent-Square

Abstract

One of the significant disadvantages of MCCDMA (Multi Code-Code Division Multiple Access) technology is a high PAPR (Peak-to-Average Power Ratio) values of used signals in such telecommunication systems. The most modern and effective solution to this problem is the C-codes based on bent-sequences. However, C-codes introduce significant redundancy in communication systems, which consumes only to reduce the signals PAPR value. In this paper, we developed a method for the synthesis of C-codes with error-correction properties on the basis of an arbitrary Agievich bent-square. To build a C-code with the specified distance properties, we used the proposed sets of semidyadic permutations. Structural properties of built C-codes allow the use of simplified procedures for coding and decoding. In this case, for length N = 256  and PAPR value κ = 1 , the cardinalities of constructed C-codes are in the range J = 512...10321920 for the code distances d = 128...64.One of the significant disadvantages of MC-CDMA (Multi Code-Code Division Multiple Access) technology is a high PAPR (Peak-to-Average Power Ratio) values of used signals in such telecommunication systems. The most modern and effective solution to this problem is the C-codes based on bent-sequences. However, C-codes introduce significant redundancy in communication systems, which consumes only to reduce the signals PAPR value. In this paper, we developed a method for the synthesis of C-codes with error-correction properties on the basis of an arbitrary Agievich bent-square. To build a C-code with the specified distance properties, we used the proposed sets of semidyadic permutations. Structural properties of built C-codes allow the use of simplified procedures for coding and decoding. In this case, for length  and PAPR value , the cardinalities of constructed C-codes are in the range  for the code distances .