Repeated-root cyclic codes

From MaRDI portal
Publication:5753885

DOI10.1109/18.75250zbMath0721.94017OpenAlexW2161496548MaRDI QIDQ5753885

J. H. van Lint

Publication date: 1991

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

Full work available at URL: https://research.tue.nl/nl/publications/3defd37a-b674-4dc3-8b47-bc0059cdfb9f




Related Items (84)

Repeated-root constacyclic codes of prime power length over \(\frac{\mathbb{F}_{p^m} [u}{\langle u^a \rangle}\) and their duals] ⋮ Matrix-product structure of repeated-root cyclic codes over finite fieldsRepeated-root constacyclic codes of length \(n l p^s\)Duality of constacyclic codes of prime power length over the finite non-commutative chain ring \(\frac{ \mathbb{F}_{p^m} [ u , \theta }{ \langle u^2 \rangle} \)] ⋮ Recent progress on weight distributions of cyclic codes over finite fieldsOn a class of repeated-root monomial-like abelian codesRepeated-root constacyclic codes of length \(3lp^s\) and their dual codesOn universally decodable matrices for space-time codingCyclic codes over the rings \(\mathbb Z_2 + u\mathbb Z_2\) and \(\mathbb Z_2 + u\mathbb Z_2 + u^2 \mathbb Z_2\)Negacyclic codes of prime power length over the finite non-commutative chain ring 𝔽pm[u,𝜃 〈u2〉] ⋮ Jack van Lint (1932--2004): a survey of his scientific workConstacyclic codes of length \(8p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)Repeated-root constacyclic codes of prime power lengths over finite chain ringsOn structure and distances of some classes of repeated-root constacyclic codes over Galois ringsCyclic self-orthogonal codes over finite chain ringOn non-binary quantum repeated-root cyclic codesNew linear codes from constacyclic codesOn modular cyclic codesRepeated-root constacyclic codes of length \(3 \ell^m p^s\)Constacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)Some new constructions of isodual and LCD codes over finite fieldsRepeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distancesSome minimal cyclic codes over finite fieldsNEGACYCLIC 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}\)Quantum 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 dualsAsymmetric quantum codes with high code ratesOptimal 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}\)Repeated-root two-dimensional constacyclic codes of length \(2p^s\cdot 2^k\)Negacyclic codes of length \(4 p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) and their dualsRepeated-root constacyclic codes of length $2p^s$ over Galois ringsCyclic codes over \(R = F_p + uF_p + \cdots + u^{k - 1}F_p\) with length \(p^sn\)MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codesMDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\)Optimal b-symbol constacyclic codes with respect to the Singleton boundSymbol-triple distance of repeated-root constacyclic codes of prime power lengthsCyclic codes over \(M_2(\mathbb F_2)\)Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)Repeated-root constacyclic codes of lengthOn the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)On cyclic codes over the ring \(\mathbb Z_p[u/\langle u^k\rangle\)] ⋮ On LCD repeated-root cyclic codes over finite fieldsQuantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)A mass formula for negacyclic codes of length \(2^k\) and some good negacyclic codes over \(\mathbb {Z}_{4}+u\mathbb {Z}_{4}\)On constacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} +u\mathbb{F}_{p^m}\)On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributionsGenetic algorithms in coding theory -- a table for \(A_ 3(n, d)\)Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds\(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approachRT 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\)Repeated-root cyclic and negacyclic codes over a finite chain ringCorrecting errors and erasures via the syndrome varietyRepeated-root constacyclic codes of length \(6lp^s\)Skew constacyclic codes over finite fields and finite chain ringsOn cyclic self-dual codesRepeated-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 self-orthogonal group ring codesOn the \(b\)-distance of repeated-root constacyclic codes of prime power lengthsOptimal binary codes derived from \(\mathbb{F}_2 \mathbb{F}_4\)-additive cyclic codesThe minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codesOn 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}\)Cyclic codes of length \(2^e\) over \(\mathbb Z_4\).Cyclic codes over \(\mathbb{Z}_{4}\) of oddly even length.Cyclic self-dual \(\mathbb Z_4\)-codes.A class of constacyclic codes over a finite fieldREPEATED-ROOT CONSTACYCLIC CODES OVER F3+uF3+uvF3On the symbol-pair distances of repeated-root constacyclic codes of length \(2 p^s\)The Hamming distances of repeated-root cyclic codes of length \(5 p^s\)Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m} \)Some families of \(\mathbb Z_4\)-cyclic codesOn 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}\)Construction of optimal codes from a class of constacyclic codesCyclic codes over the ring \(\mathbb{Z}_p [u, v / \langle u^2, v^2, u v - v u \rangle\)] ⋮ Decoding of repeated-root cyclic codes up to new bounds on their minimum distance




This page was built for publication: Repeated-root cyclic codes