F_q-linear cyclic codes over F_q^m: DFT approach
Codes over \(\mathbb F_{q^m}\) that are closed under addition and multiplication with elements from \(\mathbb F_q\) are called \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^m}\). A transform domain characterization is obtained of \(\mathbb F_q\)-linear cyclic codes using the discrete Fourier transform over an extension field of \(\mathbb F_{q^m}\). A transform domain condition is given for two vectors to be \(\mathbb F_q\)-dual of each other. This is used to prove the nonexistence of certain self-dual \(\mathbb F_q\)-linear cyclic codes and equivalently the nonexistence of the corresponding self-dual quasi-cyclic codes. The transform domain characterization of \(\mathbb F_q\)-linear cyclic codes is used to derive minimum distance bound for the corresponding quasi-cyclic codes.
- scientific article; zbMATH DE number 2081123
- DFT domain characterization of quasi-cyclic codes
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- Repeated root cyclic \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- Constacyclic \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^l}\)
- A cyclic [6,3,4] group code and the hexacode over GF(4)
- A generalized DFT for Abelian codes over Z/sub m/
- Algebraic characterization of MDS group codes over cyclic groups
- Block-coded M-PSK modulation over GF(M)
- Byte-Oriented Error-Correcting Codes for Semiconductor Memory Systems
- Direct constructions of additive codes
- Factorization of Symmetric Matrices and Trace-Orthogonal Bases in Finite Fields
- Geometrically uniform codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- On repeated-root cyclic codes
- On the algebraic structure of quasi-cyclic codes .I. Finite fields
- On the Hamming distance properties of group codes
- Repeated-root cyclic codes
- Self-orthogonal quasi-cyclic codes
- Subgroup subcodes
- Subspace subcodes of Reed-Solomon codes
- Switching codes for delta-I noise reduction
- Transform decoding of BCH codes overZm
- Transform domain characterization of abelian codes
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- Twisted BCH-codes
- Transform domain characterization of cyclic codes over \(\mathbb{Z}_ m\)
- DFT domain characterization of quasi-cyclic codes
- On the additive cyclic structure of quasi-cyclic codes
- Singleton bounds for R-additive codes
- \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_q\)-algebras
- Some optimal cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- On MDS geometric \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t} \)-codes
- On cyclic \(\mathbb F_q\)-linear \(\mathbb F_{q^{t}}\)-codes
- Additive semisimple multivariable codes over \(\mathbb{F}_4\)
- Enumeration and construction of additive cyclic codes over Galois rings
- On additive modular bivariate codes over F₄
- scientific article; zbMATH DE number 2081123 (Why is no real title available?)
- Repeated root cyclic \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- A generalized DFT for Abelian codes over Z/sub m/
- Constacyclic \(\mathbb F_q\)-linear codes over \(\mathbb F_{q^l}\)
- Semisimple multivariable \(\mathbb {F}_q\)-linear codes over \(\mathbb {F}_{q^l}\)
- Cyclic \(R\)-additive codes
- Some results on cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- Polynomial representation of additive cyclic codes and new quantum codes
- \( \ell \)-LCP of \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^m}\)
- Some optimal \(\mathbb{F}_q\)-linear codes over \(\mathbb{F}_{q^l}\)
- Griesmer type bounds for additive codes over finite fields, integral and fractional MDS codes
- DFT for cyclic code over \(F_p+ uF_p+\cdots+ u^{k-1}F_p\)
This page was built for publication: \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766099)
