On cyclic MDS codes of length q over GF(q) (Corresp.)

From MaRDI portal
Publication:3722419

DOI10.1109/TIT.1986.1057151zbMath0592.94016MaRDI QIDQ3722419

Gadiel Seroussi, Ron M. Roth

Publication date: 1986

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)




Related Items (38)

Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u}{\langle u^a \rangle}\) and their duals] ⋮ Recent progress on weight distributions of cyclic codes over finite fieldsConstacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)On the dimension of ideals in group algebras, and group codesRepeated-root constacyclic codes of prime power lengths over finite chain ringsOn structure and distances of some classes of repeated-root constacyclic codes over Galois ringsOn the permutation groups of cyclic codesConstacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p mOn self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)On symbol-pair distances of repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) and MDS symbol-pair codesQuantum MDS and synchronizable codes from cyclic codes of length \(5p^s\) over \(\mathbb{F}_{p^m}\)On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)Repeated-root constacyclic codes of length \(\ell p^s\) and their dualsSome \(q\)-ary cyclic codes from explicit monomials over \(\mathbb{F}_{q^m}\)Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length \(3p^s\)On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ringConstacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)All \(\alpha+u\beta\)-constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their dualsMDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codesSymbol-triple distance of repeated-root constacyclic codes of prime power lengthsNegacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)Repeated-root constacyclic codes of lengthOn constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)RT distance and weight distributions of Type 1 constacyclic codes of length 4ps over Fpm[u] ⋮ Repeated-root constacyclic codes of length \(2 \ell^m p^n\)Some optimal cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codesSkew constacyclic codes over finite fields and finite chain ringsRepeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \)Unnamed ItemOn Hamming and \(b\)-symbol distance distributions of repeated-root constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}+u \mathbb{F}_{p^m}\)Optimum PN Sequences for CDMA SystemsOn the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even lengthON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4psExplicit constructions of cyclic and negacyclic codes of length 3ps over 𝔽pm + u𝔽pmQuantum MDS and synchronizable codes from cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m}\)Period distribution for error-correcting codes






This page was built for publication: On cyclic MDS codes of length q over GF(q) (Corresp.)