Matrix-product structure of repeated-root cyclic codes over finite fields

Augot, 2003, Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases, 362

Augot, 2009, On the decoding of binary cyclic codes with the Newton identities, J. Symb. Comput., 44, 1608, 10.1016/j.jsc.2008.02.006

E.R. Berlekamp, Nonbinary BCH decoding, in: International Symposium on Information Theory, San Remo, Italy, 1967.

Blackmore, 2001, Matrix-product codes over Fq, Appl. Algebra Eng. Commun. Comput., 12, 477, 10.1007/PL00004226

Blokh, 1974, Coding of generalized concatenated codes, Probl. Inf. Transm., 10, 218

Castagnoli, 1991, On repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37, 337, 10.1109/18.75249

Chen, 1994, Use of Gröbner bases to decode binary cyclic codes up to the true minimum distance, IEEE Trans. Inf. Theory, 40, 1654, 10.1109/18.333885

Chen, 1994, General principles for the algebraic decoding of cyclic codes, IEEE Trans. Inf. Theory, 40, 1661, 10.1109/18.333886

Dinh, 2008, On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions, Finite Fields Appl., 14, 22, 10.1016/j.ffa.2007.07.001

Dinh, 2004, Cyclic and negacyclic codes over finite chain rings, IEEE Trans. Inf. Theory, 50, 1728, 10.1109/TIT.2004.831789

Fan, 2014, Homogeneous weights of matrix product codes over finite principal ideal rings, Finite Fields Appl., 29, 247, 10.1016/j.ffa.2014.05.004

Fan, 2014, Matrix product codes over finite commutative Frobenius rings, Des. Codes Cryptogr., 71, 201, 10.1007/s10623-012-9726-y

Feng, 1991, A generalization of the Berlekamp–Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes, IEEE Trans. Inf. Theory, 37, 1274, 10.1109/18.133246

Forney, 1988, Coset codes. Part II, IEEE Trans. Inf. Theory, 34, 1152, 10.1109/18.21246

Hernando, 2009, Construction and decoding of matrix-product codes from nested codes, Appl. Algebra Eng. Commun. Comput., 20, 497, 10.1007/s00200-009-0113-5

Hernando, 2013, Decoding of matrix-product codes, J. Algebra Appl., 12, 10.1142/S021949881250185X

Kschischang, 1992, Some ternary and quaternary codes and associated sphere packings, IEEE Trans. Inf. Theory, 38, 227, 10.1109/18.119683

Martínez-Moro, 2004, A generalization of Niederreiter–Xing's propagation rule and its commutativity with duality, IEEE Trans. Inf. Theory, 50, 701, 10.1109/TIT.2004.825036

Massey, 1969, Shift-register synthesis and BCH decoding, IEEE Trans. Inf. Theory, IT-15, 122, 10.1109/TIT.1969.1054260

Nedeloaia, 2003, Weight distributions of cyclic self-dual codes, IEEE Trans. Inf. Theory, 49, 1582, 10.1109/TIT.2003.811921

Niederreiter, 2000, A propagation rule for linear codes, Appl. Algebra Eng. Commun. Comput., 10, 425, 10.1007/s002009900017

Norton, 2000, On the structure of linear and cyclic codes over a finite chain ring, Appl. Algebra Eng. Commun. Comput., 10, 489, 10.1007/PL00012382

Özbudak, 2002, Note on Niederreiter–Xing's propagation rule for linear codes, Appl. Algebra Eng. Commun. Comput., 13, 53, 10.1007/s002000100091

van Asch, 2008, Matrix-product codes over finite chain rings, Appl. Algebra Eng. Commun. Comput., 19, 39, 10.1007/s00200-008-0063-3

van Lint, 1991, Repeated-root cyclic codes, IEEE Trans. Inf. Theory, 37, 343, 10.1109/18.75250

Zeh

Zimmermann, 1996, On generalizations of repeated-root cyclic codes, IEEE Trans. Inf. Theory, 42, 641, 10.1109/18.485736