On matrix-product structure of repeated-root constacyclic codes over finite fields

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

Bakshi, 2012, A class of constacyclic codes over a finite field, Finite Fields Appl., 18, 362, 10.1016/j.ffa.2011.09.005

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

Cao, 2013, On constacyclic codes over finite chain rings, Finite Fields Appl., 24, 124, 10.1016/j.ffa.2013.07.001

Cao, 2019, A class of repeated-root constacyclic codes over Fpm[u]∕〈ue〉 of Type 2, Finite Fields Appl., 55, 238, 10.1016/j.ffa.2018.10.003

Cao, 2019, Type 2 constacyclic codes over F2m[u]∕〈u3〉 of oddly even length, Discrete Math., 342, 412, 10.1016/j.disc.2018.10.005

Cao, 2020, A class of linear codes of length 2 over finite chain rings, J. Algebra Appl., 19, 10.1142/S0219498820501030

Cao, 2020, Construction and enumeration for self-dual cyclic codes of even length over F2m+uF2m, Finite Fields Appl., 61, 10.1016/j.ffa.2019.101598

Cao, 2019, An explicit representation and enumeration for self-dual cyclic codes over F2m+uF2m of length 2s, Discrete Math., 342, 2077, 10.1016/j.disc.2019.04.008

Cao, 2018, Matrix-product structure of constacyclic codes over finite chain rings Fpm[u]∕〈ue〉, Appl. Algebra Engrg. Comm. Comput., 29, 455, 10.1007/s00200-018-0352-4

Dinh, 2016, Repeated-root constacyclic codes of prime power length over Fpm[u]〈ua〉 and their duals, Discrete Math., 339, 1706, 10.1016/j.disc.2016.01.020

Dinh, 2019, MDS Symbol-pair repeated-root constacylic codes of prime power lengths over Fpm+uFpm, IEEE Access, 7, 145039, 10.1109/ACCESS.2019.2944483

Dinh, 2019, On a class of constacyclic codes of length 4ps over Fpm[u]ua, Algebra Colloq., 26, 181, 10.1142/S1005386719000166

Dinh, 2019, RT distance and weight distributions of type 1 constacyclic codes of length 4ps overFpm[u]ua, Turk. J. Math., 43, 561, 10.3906/mat-1808-108

Dinh, 2019, Skew constacyclic codes over finite commutative semi-simple rings, Bull. Korean Math. Soc., 56, 419

Dinh, 2020, MDS Symbol-pair cyclic codes of length 2ps over Fpm, IEEE Trans. Inform. Theory, 10.1109/TIT.2019.2941885

Dinh, 2019, Structure of some classes of repeated-root constacyclic codes of length 2Kℓmpn, Discrete Math., 342

Dinh, 2019, Cyclic codes over the ring GR(pem)[u]∕〈uk〉, Discrete Math.

Dinh, 2019, On the hamming distance of repeated-root constacyclic codes of length 4ps, Discrete Math., 342, 1456, 10.1016/j.disc.2019.01.023

Dinh, 2019, On the symbol-pair distances of repeated-root constacyclic codes of length 2ps, Discrete Math.

Dinh, 2020, Optimal b-symbol constacyclic codes with respect to the singleton bound, J. Algebra Appl., 19, 10.1142/S0219498820501510

van Eupen, 1993, On the minimum distance of ternary cyclic codes, IEEE Trans. Inform. Theory, 39, 409, 10.1109/18.212272

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

Hammons, 1994, The Z4-linearity of kerdock, preparata, goethals, and related codes, IEEE Trans. Inform. Theory, 40, 301, 10.1109/18.312154

Hammons Jr, 1994, The Z4-linearty of kerdock, Preparata, Goethals and Related codes, IEEE. Trans. Inform. Theory, 40, 301

Hernando, 2012, List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes, Adv. Math. Commun., 6, 259, 10.3934/amc.2012.6.259

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, 2010, New linear codes from matrix-product codes with polynomial units, Adv. Math. Commun., 4, 363, 10.3934/amc.2010.4.363

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

Huffman, 2003

Hughes, 2000, Constacyclic codes cocycles and a (u+v|u−v) construction, IEEE Trans. Inform. Theory, 46, 674, 10.1109/18.825841

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

Ling, 2001, Decomposing quasi-cyclic codes, vol. 6, 412

Ling, 2003, On the algebraic structure of quasi-cyclic codes II: chain rings, Des. Codes Cryptogr., 30, 113, 10.1023/A:1024715527805

Liu, 2019, Repeated-root constacyclic codes of length 3ℓmps, Advances Math. Comm.

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

Medeni, 2011, Construction and bound on the performance of matrix-product codes, Appl. Math. Sci. (Ruse), 5, 929

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 finite chain rings, Appl. Algebra Engrg. Comm. 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

Sobhani, 2016, Matrix-product structure of repeated-root cyclic codes over finite fields, Finite Fields Appl., 39, 216, 10.1016/j.ffa.2016.02.001

Wood, 1999, Duality for modules over finite rings and applications to coding theory, Am. J. Math., 121, 555, 10.1353/ajm.1999.0024

Wood, 2008, Code equivalence characterizes finite frobenius rings, Proc. Amer. Math. Soc., 136, 699, 10.1090/S0002-9939-07-09164-2