On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions

From MaRDI portal
Publication:2469466

DOI10.1016/j.ffa.2007.07.001zbMath1129.94047OpenAlexW2052503266MaRDI QIDQ2469466

Hai Quang Dinh

Publication date: 6 February 2008

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ffa.2007.07.001




Related Items (58)

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\)On constacyclic codes over finite fieldsMatrix-product structure of constacyclic codes over finite chain rings \(\mathbb{F}_{p^m}[u/\langle u^e\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 codesSome constacyclic codes over finite chain ringsRepeated-root constacyclic codes of prime power lengths over finite chain ringsOn structure and distances of some classes of repeated-root constacyclic codes over Galois ringsRepeated-root constacyclic codes of length \(3 \ell^m p^s\)The weight distributions of constacyclic codesConstacyclic codes of length \(p^s\) over \(\mathbb F_{p^m} + u\mathbb F_{p^m}\)Binary cyclic codes from explicit polynomials over \(\mathrm{GF}(2^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 codesOn 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 ratesOn the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ringOn rank and MDR cyclic and negacyclic codes of length \(p^k\) over \(\mathbb Z_{p^m}\)New quantum codes from negacyclic codes of length \(p^s\) over \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\)A characterization of optimal constacyclic locally repairable codesThe symbol-pair distance distribution of a class of repeated-root cyclic codes over \(\mathbb {F}_{p^{m}}\)On Rank and MDR Cyclic Codes of Length $$2^k$$ 2 k Over $$Z_8$$ Z 8MDS constacyclic codes of prime power lengths over finite fields and construction of quantum MDS codesPolycyclic codes over \(\mathbb{F}_{p^m} [u / \langle u^2 \rangle \): classification, Hamming distance, and annihilators] ⋮ Optimal b-symbol constacyclic codes with respect to the Singleton boundSymbol-triple distance of repeated-root constacyclic codes of prime power lengthsExplicit factorization of \(X^{2^m}p^n-1\) over a finite fieldOn constacyclic codes over finite chain ringsRepeated-root constacyclic codes of lengthOn the Hamming distances of repeated-root constacyclic codes of length \(4p^s\)Unnamed ItemSelf-dual and self-orthogonal negacyclic codes of length \(2^m p^n\) over a finite fieldDNA cyclic codes over the ring 𝔽2[u,v/〈u2 − 1,v3 − v,uv − vu〉] ⋮ A note on the weight distribution of some cyclic codesLee distance of cyclic and \((1 + u\gamma)\)-constacyclic codes of length \(2^s\) over \(\mathbb{F}_{2^m} + u \mathbb{F}_{2^m} \)Quantum codes from repeated-root cyclic and negacyclic codes of length \(4p^s\) over \(\mathbb{F}_{p^m} \)Some cyclic codes from some monomialsHamming distances of constacyclic codes of length \(3p^s\) and optimal codes with respect to the Griesmer and Singleton boundsRT 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\)A class of constacyclic codes over \(\mathbb Z_{p^m}\)Complete classification of repeated-root \(\sigma\)-constacyclic codes of prime power length over \(\mathbb{F}_{p^m} [ u \slash \langle u^3 \rangle \)] ⋮ Repeated-root constacyclic codes of length \(6lp^s\)On cyclic self-dual codesOn the \(b\)-distance of repeated-root constacyclic codes of prime power lengthsThe 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}\)Repeated-root constacyclic codes of length \(k\ell p^s\)A class of constacyclic codes over a finite fieldThe 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 lengthClasses of constacyclic codes of length \(p^s\) over the ring \(\mathbb F_{p^m}+u \mathbb F_{p^m}+v\mathbb F_{p^m}+uv\mathbb F_{p^m}\)Construction of optimal codes from a class of constacyclic codesTwo new families of quantum synchronizable codes



Cites Work




This page was built for publication: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions