A class of constacyclic codes are generalized Reed-Solomon codes

DOI10.1007/S10623-023-01294-6MaRDI QIDQ6070360zbMATH OpenOpenAlexFDO

Authors Hongwei Liu, Shengwei Liu

Publication date 20 November 2023

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

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

zbMATH Keywords

constacyclic codesGRS codesMDS codesSchur square

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Abstract: Maximum distance separable (MDS) codes are optimal in the sense that the minimum distance cannot be improved for a given length and code size. The most prominent MDS codes are generalized Reed-Solomon (GRS) codes. The square $mathcal{C}^2$ of a linear code $mathcalC$ is the linear code spanned by the component-wise products of every pair of codewords in $mathcalC$. For an MDS code $mathcalC$, it is convenient to determine whether $mathcalC$ is a GRS code by determining the dimension of $mathcal{C}^2$. In this paper, we investigate under what conditions that MDS constacyclic codes are GRS. For this purpose, we first study the square of constacyclic codes. Then, we give a sufficient condition that a constacyclic code is GRS. In particular, We provide a necessary and sufficient condition that a constacyclic code of a prime length is GRS.

Recommendations

• MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)
• Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes
• A class of constacyclic MDS codes over \(F_q+uF_q+\cdots+u^{s-1}F_q\)
• Maximum distance separable repeated-root constacyclic codes over \(\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}\) with respect to the Lee distance
• New MDS self-dual codes from GRS codes and extended GRS codes

Cites work

• A construction of non-Reed-Solomon type MDS codes
• Application of Constacyclic Codes to Quantum MDS Codes
• Application of GRS codes to some entanglement-assisted quantum MDS codes
• Application of Hermitian self-orthogonal GRS codes to some quantum MDS codes
• Constacyclic Codes and Some New Quantum MDS Codes
• Constructing MDS Galois self-dual constacyclic codes over finite fields
• Construction of MDS twisted Reed-Solomon codes and LCD MDS codes
• Critical Pairs for the Product Singleton Bound
• Determining When a Truncated Generalised Reed-Solomon Code Is Hermitian Self-Orthogonal
• Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes
• Introduction to Coding Theory
• Nonbinary quantum codes
• Nonbinary quantum stabilizer codes
• On generator matrices of MDS codes (Corresp.)
• On products and powers of linear codes under componentwise multiplication
• On Squares of Cyclic Codes
• On the Addition of Residue Classes
• Properties of constacyclic codes under the Schur product
• Some New Classes of Quantum MDS Codes From Constacyclic Codes
• Squares of Random Linear Codes
• The Critical Pairs of Subsets of a Group of Prime Order
• The theory of cyclic codes and a generalization to additive codes
• Twisted Reed–Solomon Codes

Cited in

(4)

• A class of twisted generalized Reed-Solomon codes
• Grassl-Rötteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes
• On the nonperiodic cyclic equivalence classes of Reed-Solomon codes
• MDS constacyclic codes of length \(q+1\) over \(\mathrm{GF}(q)\)

This page was built for publication: A class of constacyclic codes are generalized Reed-Solomon codes

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