Representation of Cascade Codes in the Frequency Domain

The mathematical apparatus of the multidimensional discrete Fourier transform over finite fields is considered. Methods for the description of linear block codes in the frequency domain are investigated. It is shown that, in contrast to iterative codes (code-products), cascade codes in the general case cannot be described in the frequency domain in terms of multidimensional spectra. Analytic expressions are obtained that establish a one-to-one functional correspondence between the spectrum of a sequence over a finite field and the spectra of the corresponding words obtained by limiting this word to a subfield. A general solution of the problem of representation of cascade codes in the frequency domain is obtained, which allows constructing in the frequency domain using computationally efficient algorithms of encoding and decoding, and the derived analytic dependences of components of multidimensional spectra.

[1]  Tamara Radivilova,et al.  Decrypting SSL/TLS traffic for hidden threats detection , 2018, 2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT).

[2]  L. Zhong,et al.  Speeding up the Arithmetic Operations over Optimal Extension Fields in the Lagrange Representation Using DFT , 2010, 2010 International Conference on Innovative Computing and Communication and 2010 Asia-Pacific Conference on Information Technology and Ocean Engineering.

[3]  R. Stasinski.  Fourier transform algorithm for a prime number blocklength Reed-Solomon code can be computationally efficient , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[4]  Peter Trifonov,et al.  Finding roots of polynomials over finite fields , 2002, IEEE Trans. Commun..

[5]  Trieu-Kien Truong,et al.  On decoding of both errors and erasures of a Reed-Solomon code using an inverse-free Berlekamp-Massey algorithm , 1999, IEEE Trans. Commun..

[6]  Tamara Radivilova,et al.  Test for penetration in Wi-Fi network: Attacks on WPA2-PSK and WPA2-enterprise , 2017, 2017 International Conference on Information and Telecommunication Technologies and Radio Electronics (UkrMiCo).

[7]  Alexandr Kuznetsov,et al.  Code-based key encapsulation mechanisms for post-quantum standardization , 2018, 2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT).

[8]  Sergii Kavun,et al.  Code-based cryptosystems from NIST PQC , 2018, 2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT).

[9]  Stephen B. Wicker,et al.  Reed-Solomon Codes and Their Applications , 1999 .

[10]  Manisha A. Hatwar,et al.  Design of common sub expression elimination algorithm in fast Fourier transform , 2015, 2015 International Conference on Communications and Signal Processing (ICCSP).

[11]  Trieu-Kien Truong,et al.  Fast transforms for decoding Reed-Solomon codes , 1981 .

[12]  Sandro Bellini,et al.  On the Reduction of Additive Complexity of Cyclotomic FFTs , 2012, IEEE Transactions on Communications.

[13]  Richard E. Blahut,et al.  Fast Algorithms for Digital Signal Processing , 1985 .

[14]  Alexandr Kuznetsov,et al.  Code-based electronic digital signature , 2018, 2018 IEEE 9th International Conference on Dependable Systems, Services and Technologies (DESSERT).

[15]  A complex-valued cyclic code using fast Fourier transform , 2001, 2001 IEEE Third Workshop on Signal Processing Advances in Wireless Communications (SPAWC'01). Workshop Proceedings (Cat. No.01EX471).

[16]  Roman A. Solovyev,et al.  Efficient calculation of cyclic convolution by means of fast Fourier transform in a finite field , 2014, Proceedings of IEEE East-West Design & Test Symposium (EWDTS 2014).

[17]  Alexandr Kuznetsov,et al.  Construction of cascade codes in the frequency domain , 2017, 2017 4th International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T).

[19]  Bulakh Vitalii,et al.  Fractal time series analysis of social network activities , 2017, 2017 4th International Scientific-Practical Conference Problems of Infocommunications. Science and Technology (PIC S&T).

[20]  J. Bibb Cain,et al.  Error-Correction Coding for Digital Communications , 1981 .

[21]  R. Blahut.  Theory and practice of error control codes , 1983 .

[22]  A. Kuznetsov,et al.  NIST PQC: CODE-BASED CRYPTOSYSTEMS , 2018, Telecommunications and Radio Engineering.

[23]  Tamara Radivilova,et al.  Dynamic load balancing algorithm of distributed systems , 2016, 2016 13th International Conference on Modern Problems of Radio Engineering, Telecommunications and Computer Science (TCSET).

[25]  S. Winograd.  On computing the Discrete Fourier Transform. , 1976, Proceedings of the National Academy of Sciences of the United States of America.

[26]  Peter Trifonov,et al.  A Method for Fast Computation of the Fourier Transform over a Finite Field , 2003, Probl. Inf. Transm..