Decoding of quasi-cyclic codes up to a new lower bound on the minimum distance

A new lower bound on the minimum Hamming distance of linear quasi-cyclic codes over finite fields is proposed. It is based on spectral analysis and generalizes the Semenov-Trifonov bound in a similar way as the Hartmann-Tzeng bound extends the BCH approach for cyclic codes. Furthermore, a syndrome-based algebraic decoding algorithm is given.

[1]  Irina Adjudeanu,et al.  Codes correcteurs d'erreurs LDPC structurés , 2010 .

[2]  Carlos R. P. Hartmann.  Decoding beyond the BCH bound (Corresp.) , 1972, IEEE Trans. Inf. Theory.

[3]  E. J. Weldon,et al.  Some Results on Quasi-Cyclic Codes , 1969, Inf. Control..

[4]  Kristine Lally,et al.  Algebraic lower bounds on the free distance of convolutional codes , 2006, IEEE Transactions on Information Theory.

[5]  Patrick Solé,et al.  On the algebraic structure of quasi-cyclic codes I: Finite fields , 2001, IEEE Trans. Inf. Theory.

[6]  Clément Pernet,et al.  On the decoding of quasi-BCH codes , 2012, ArXiv.

[7]  Patrick Solé,et al.  On the algebraic structure of quasi-cyclic codes III: generator theory , 2005, IEEE Transactions on Information Theory.

[8]  Gou Hosoya,et al.  国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .

[9]  Peter Trifonov,et al.  Spectral Method for Quasi-Cyclic Code Analysis , 2012, IEEE Communications Letters.

[10]  Gui Liang Feng,et al.  A generalized Euclidean algorithm for multisequence shift-register synthesis , 1989, IEEE Trans. Inf. Theory.

[11]  T. Aaron Gulliver,et al.  A Link Between Quasi-Cyclic Codes and Convolutional Codes , 1998, IEEE Trans. Inf. Theory.

[12]  Alexander Zeh,et al.  Fast multi-sequence shift-register synthesis with the Euclidean algorithm , 2011, Adv. Math. Commun..

[13]  Vijay K. Bhargava,et al.  Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes , 1991, IEEE Trans. Inf. Theory.

[14]  Patrick Fitzpatrick,et al.  Algebraic structure of quasicyclic codes , 2001, Discret. Appl. Math..

[15]  Patrick Solé,et al.  On the Algebraic Structure of Quasi-cyclic Codes II: Chain Rings , 2003, Des. Codes Cryptogr..

[16]  Morgan Barbier,et al.  On quasi-cyclic codes as a generalization of cyclic codes , 2012, Finite Fields Their Appl..

[17]  Dwijendra K. Ray-Chaudhuri,et al.  Binary mixture flow with free energy lattice Boltzmann methods , 2022, arXiv.org.

[18]  G. Solomon,et al.  A Connection Between Block and Convolutional Codes , 1979 .

[19]  C. R. P. Hartmann.  Decoding beyond the BCH bound , 1971 .

[20]  Gui Liang Feng,et al.  A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

[21]  Richard M. Wilson,et al.  On the minimum distance of cyclic codes , 1986, IEEE Trans. Inf. Theory.

[22]  Carlos R. P. Hartmann,et al.  Generalizations of the BCH Bound , 1972, Inf. Control..