On squares of cyclic codes

Abstract

The square $C^{\ast 2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications mainly in the area of cryptography, and typically in those applications one is concerned about some of the parameters (dimension, minimum distance) of both $C^{\ast 2}$ and $C$. In this paper, motivated mostly by the study of this problem in the case of linear codes defined over the binary field, squares of cyclic codes are considered. General results on the minimum distance of the squares of cyclic codes are obtained and constructions of cyclic codes $C$ with relatively large dimension of $C$ and minimum distance of the square $C^{\ast 2}$ are discussed. In some cases, the constructions lead to codes $C$ such that both $C$ and $C^{\ast 2}$ simultaneously have the largest possible minimum distances for their length and dimensions.

Accepted at IEEE Transactions on Information Theory. IEEE early access version available at https://ieeexplore.ieee.org/document/8451926/

Cited by in corpus (9)

• Asymmetric entanglement-assisted quantum error-correcting codes and BCH codes
• Squares of Matrix-product Codes
• Entanglement-Assisted Quantum Error Correcting Codes From RS Codes and BCH Codes with Extension Degree 2
• An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
• Algebraic geometry codes and some applications
• Private Information Retrieval Schemes Using Cyclic Codes
• Some properties of dihedral group codes
• Steane enlargement of Entanglement-Assisted Quantum Error-Correcting Codes
• New quantum codes from homothetic-BCH codes