On repeated-root cyclic codes

DOI10.1109/18.75249zbMath0721.94016OpenAlexW2102759336MaRDI QIDQ5753884

Guy Castagnoli, Niklaus von Seemann, Philipp A. Schoeller, James L. Massey

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1109/18.75249

zbMATH Keywords

minimum distancegenerator polynomialparity-check matrixformal derivativeHasse derivativeq-ary repeated-root cyclic codesimple-root cyclic code

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cyclic codes (94B15)

Related Items

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 fields, Repeated-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} \)], A construction of optimal nonbinary pure quantum stabilizer codes, Linear Complexity of Periodic Sequences: A General Theory, Recent progress on weight distributions of cyclic codes over finite fields, On a class of repeated-root monomial-like abelian codes, Repeated-root constacyclic codes of length \(3lp^s\) and their dual codes, On universally decodable matrices for space-time coding, Cyclic 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 work, Constacyclic 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 rings, On structure and distances of some classes of repeated-root constacyclic codes over Galois rings, On non-binary quantum repeated-root cyclic codes, New linear codes from constacyclic codes, On modular cyclic codes, Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\), Repeated-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}\), Algebraic quantum synchronizable codes, Repeated root cyclic codes over \(\mathbb{Z}_{p^2}+u\mathbb{Z}_{p^2}\) and their Lee distances, Constructions of MDS symbol-pair codes with minimum distance seven or eight, NEGACYCLIC CODES OF LENGTH 8p s OVER F p m + uF p m, On self-dual constacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), AMDS symbol-pair codes from repeated-root cyclic codes, Quantum error-correcting codes from the quantum construction \(X\), 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 duals, Asymmetric quantum codes with high code rates, 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 ring, Constacyclic codes of length \(2p^{s}\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), MDS and AMDS symbol-pair codes constructed from repeated-root cyclic codes, 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 duals, Repeated-root constacyclic codes of length $2p^s$ over Galois rings, A characterization of optimal constacyclic locally repairable codes, MDS symbol-pair repeated-root constacylic codes of prime power lengths over \(\mathbb{F}_q+ u\mathbb{F}_q + u^2\mathbb{F}_q\), Cyclic codes of length \(5p\) with MDS symbol-pair, Optimal b-symbol constacyclic codes with respect to the Singleton bound, Symbol-triple distance of repeated-root constacyclic codes of prime power lengths, Negacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\), Repeated-root constacyclic codes of length, On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\), On LCD repeated-root cyclic codes over finite fields, Quantum 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 distributions, Towards a general construction of recursive MDS diffusion layers, A survey on proper codes, Hamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton bounds, Cyclic and negacyclic codes over the Galois ring \(\text{GR}(p^2,m)\), \(\mathbb F_q\)-linear cyclic codes over \(\mathbb F_{q^m}\): DFT approach, 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\), Repeated-root cyclic and negacyclic codes over a finite chain ring, QUANTUM CODES CONSTRUCTED FROM BINARY CYCLIC CODES, On the algebraic structure of quasi-cyclic codes. IV: Repeated roots, Correcting errors and erasures via the syndrome variety, Repeated-root constacyclic codes of length \(6lp^s\), Skew constacyclic codes over finite fields and finite chain rings, On cyclic self-dual codes, Repeated-root constacyclic codes of length \(2p^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}+u^2\mathbb{F}_{p^m} \), On the cyclic order distribution and partitioning of linear cyclic codes, Unnamed Item, On self-orthogonal group ring codes, On the \(b\)-distance of repeated-root constacyclic codes of prime power lengths, Optimal binary codes derived from \(\mathbb{F}_2 \mathbb{F}_4\)-additive cyclic codes, The minimum Hamming distances of repeated-root cyclic codes of length \(6p^s\) and their MDS codes, On 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., A quantum error-correction circuit based on cyclic code, MDS symbol-pair codes from repeated-root cyclic codes, A class of constacyclic codes over a finite field, REPEATED-ROOT CONSTACYCLIC CODES OVER F3+uF3+uvF3, On 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} \), On the construction of self-dual cyclic codes over \(\mathbb{Z}_4\) with arbitrary even length, Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes, ON REPEATED-ROOT CONSTACYCLIC CODES OF LENGTH 4p^s, Explicit constructions of cyclic and negacyclic codes of length 3ps over 𝔽pm + u𝔽pm, Quantum 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 codes, Two new families of quantum synchronizable codes, The condition for a cyclic code to have a complementary dual, Decoding of repeated-root cyclic codes up to new bounds on their minimum distance