On the Hamming distance of linear codes over a finite chain ring
From MaRDI portal
Publication:4503568
DOI10.1109/18.841186zbMath0963.94043OpenAlexW2160607895MaRDI QIDQ4503568
Graham H. Norton, Ana Sălăgean
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cbc63d6cd28e76c9bf7384c2f35221f0d1328345
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (51)
Higher weights and near-MDR codes over chain rings ⋮ Hermitian LCD codes over \(\mathbb{F}_{q^2}+u \mathbb{F}_{q^2}\) and their applications to maximal entanglement EAQECCs ⋮ Fast computation of the rank profile matrix and the generalized Bruhat decomposition ⋮ Construction of extremal self-dual codes over \(\mathbb Z_8\) and \(\mathbb Z_{16}\) ⋮ On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings ⋮ The Dual of Convolutional Codes Over $${\mathbb {Z}}_{p^r}$$ ⋮ Self-Dual Linear Codes over $\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}$ and Their Applications in the Study of Quasi-Abelian Codes ⋮ A family of constacyclic codes over \(\mathbb F_{2} + u\mathbb F_{2} + v\mathbb F_{2} + uv\mathbb F_{2}\) ⋮ Unnamed Item ⋮ Critical node detection problem for complex network in undirected weighted networks ⋮ Unnamed Item ⋮ Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings ⋮ Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\) ⋮ List decoding of convolutional codes over integer residue rings ⋮ ON LCD CODES OVER FINITE CHAIN RINGS ⋮ \(l\)-LIPs of codes over finite chain rings ⋮ Corrigendum to: ``\(l\)-LIPs of codes over finite chain rings ⋮ On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\) ⋮ On quantum stabilizer codes derived from local Frobenius rings ⋮ 1-generator quasi-cyclic codes over finite chain rings ⋮ Convolutional codes over finite chain rings, MDP codes and their characterization ⋮ Entropy-Based Selection of Cluster Representatives for Document Image Compression ⋮ Higher weights for codes over rings ⋮ Linear complementary pair of group codes over finite chain rings ⋮ Construction of self-dual MDR cyclic codes over finite chain rings ⋮ \(n\)-dimensional quasi-cyclic codes over finite chain rings ⋮ Weight distributions of generalized quasi-cyclic codes over \(\mathbb{F}_q + u \mathbb{F}_q\) ⋮ Matrix product codes over finite commutative Frobenius rings ⋮ Negacyclic self-dual codes over finite chain rings ⋮ A matrix based list decoding algorithm for linear codes over integer residue rings ⋮ Linear complementary pairs of codes over rings ⋮ Critical problem for codes over finite chain rings ⋮ Decoding of cyclic codes over the ring \(F_2+uF_2+u^2F_2\) ⋮ On MDS convolutional codes over \(\mathbb{Z}_{p^r}\) ⋮ MDS and self-dual codes over rings ⋮ Repeated-root cyclic and negacyclic codes over a finite chain ring ⋮ A note on negacyclic self-dual codes over \(\mathbb Z_{2^{a}}\) ⋮ Unnamed Item ⋮ A note on characteristic generators of a free cyclic code and its dual ⋮ Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\) ⋮ MDS codes over finite principal ideal rings ⋮ Construction of MDS self-dual codes over Galois rings ⋮ 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}\) ⋮ Quantum cyclic codes over \( \mathbb{Z}_m \) ⋮ Decoding of cyclic codes over the ring \(\frac{F_2[u}{{\langle{u^t}\rangle }}\)] ⋮ On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\) ⋮ A method for constructing self-dual codes over \(\mathbb {Z}_{2^m}\) ⋮ Lifted codes and their weight enumerators ⋮ LCD codes over finite chain rings ⋮ Weight distribution of double cyclic codes over Galois rings ⋮ Further results on higher weights of codes over finite rings
This page was built for publication: On the Hamming distance of linear codes over a finite chain ring
