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

DOI10.1016/J.DISC.2019.111768MaRDI QIDQ2297724zbMATH OpenOpenAlexFDO

Authors Yuan Cao, Paravee Maneejuk, Yonglin Cao, Hai Quang Dinh, Fangwei Fu

Publication date 20 February 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.08819

zbMATH Keywords

finite chain ringmatrix-product codemonomially equivalent codesrepeated-root constacyclic code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Abstract: For any prime number $p$, positive integers $m,k,n$ satisfying $mgcd(p,n)=1$ and $lambd{a}_{0}inmathbb{F}_{p^m}^{i}mes$, we prove that any $lambd{a}_0^{p^k}$-constacyclic code of length $p^{k}n$ over the finite field $mathbb{F}_{p^m}$ is monomially equivalent to a matrix-product code of a nested sequence of $p^k$ $lambd{a}_0$-constacyclic codes with length $n$ over $mathbb{F}_{p^m}$.

Recommendations

• Repeated-root constacyclic codes of prime power length
• On the Hamming distances of repeated-root constacyclic codes of length 4p^s
• Matrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• A class of constacyclic codes over a finite field. II
• Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes

Cites work

• A Generalization of Niederreiter–Xing's Propagation Rule and Its Commutativity With Duality
• A class of constacyclic codes over a finite field
• A class of linear codes of length \(2\) over finite chain rings
• A class of repeated-root constacyclic codes over \(\mathbb{F}_{p^m} [u] / \langle u^e \rangle\) of type 2
• A propagation rule for linear codes
• An explicit representation and enumeration for self-dual cyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) of length \(2^s\)
• Code equivalence characterizes finite Frobenius rings
• Constacyclic codes, cocycles and a u+v|u-v construction
• Construction and bound on the performance of matrix-product codes
• Construction and decoding of matrix-product codes from nested codes
• Construction and enumeration for self-dual cyclic codes of even length over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)
• DECODING OF MATRIX-PRODUCT CODES
• Decomposing quasi-cyclic codes
• Duality for modules over finite rings and applications to coding theory
• Fundamentals of Error-Correcting Codes
• List decoding of matrix-product codes from nested codes: an application to quasi-cyclic codes
• MDS Symbol-Pair Cyclic Codes of Length $2p^s$ over $\mathbb F_{p^m}$
• Matrix product codes over finite commutative Frobenius rings
• Matrix-product codes over \(\mathbb{F}_q\)
• Matrix-product codes over finite chain rings
• Matrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• Matrix-product structure of repeated-root cyclic codes over finite fields
• New linear codes from matrix-product codes with polynomial units
• Note on Niederreiter-Xing's propagation rule for linear codes
• On a class of constacyclic codes of length \(4p^s\) over \(\frac{\mathbb{F}_pm[u]}{\langle u^a\rangle}\)
• On constacyclic codes over finite chain rings
• On the Hamming distances of repeated-root constacyclic codes of length 4p^s
• On the algebraic structure of quasi-cyclic codes. II: Chain rings
• On the minimum distance of ternary cyclic codes
• On the structure of linear and cyclic codes over a finite chain ring
• On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)
• Optimal \(b\)-symbol constacyclic codes with respect to the Singleton bound
• RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u]
• Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u]}{\langle u^a \rangle}\) and their duals
• Skew constacyclic codes over finite commutative semi-simple rings
• Some ternary and quaternary codes and associated sphere packings
• Structure of some classes of repeated-root constacyclic codes of length \(2^{\mathfrak{K}} \ell^m p^n\)
• The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
• Type 2 constacyclic codes over \(\mathbb{F}_{2^m} [u] \slash \langle u^3 \rangle\) of oddly even length

Cited in

(16)

• MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codes
• Matrix-product structure of repeated-root cyclic codes over finite fields
• Constructing MDS Galois self-dual constacyclic codes over finite fields
• Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• Matrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
• On the structure of repeated-root polycyclic codes over local rings
• Some self-dual codes and isodual codes constructed by matrix product codes
• Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)
• On \(\mathbb{F}_2 RS\)-cyclic codes and their applications in constructing optimal codes
• New stabilizer codes from the construction of dual-containing matrix-product codes
• Properties of constacyclic codes under the Schur product
• Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)
• New quantum codes from matrix-product codes over small fields
• Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds
• On constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} [ u , v ] \slash \langle u^2 , v^2 , u v - v u \rangle \)
• Constacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)

This page was built for publication: On matrix-product structure of repeated-root constacyclic codes over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297724)