On the Hamming distance of linear codes over a finite chain ring
From MaRDI portal
(Redirected from On the Hamming distance of linear codes over a finite chain ring)
Recommendations
- scientific article; zbMATH DE number 2081131
- On the structure of linear and cyclic codes over a finite chain ring
- Linear codes over finite chain rings
- Hamming and Reed-Solomon codes over certain rings
- A class of linear codes of length 2 over finite chain rings
- Gilbert-Varshamov type bounds for linear codes over finite chain rings
- Linearly representable codes over chain rings
- scientific article; zbMATH DE number 1498809
- On generalized Hamming weights for Galois ring linear codes
- Linear codes over finite chain rings.
Cited in
(66)- MDS codes over finite principal ideal rings
- Construction of MDS self-dual codes over Galois rings
- On the distances of cyclic codes of length \(2^e\) over \(\mathbb Z_4\)
- Higher weights and near-MDR codes over chain rings
- On counting subring-submodules of free modules over finite commutative Frobenius rings
- Constacyclic codes of length \(np^s\) over \(\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}\)
- 1-generator quasi-cyclic codes over finite chain 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}\)
- Weight distribution of double cyclic codes over Galois rings
- Further results on higher weights of codes over finite rings
- Hermitian LCD codes over \(\mathbb{F}_{q^2}+u \mathbb{F}_{q^2}\) and their applications to maximal entanglement EAQECCs
- On the enumeration and classification of \(\sigma\)-LCD codes over finite commutative chain rings
- Critical node detection problem for complex network in undirected weighted networks
- Identification of proteins by the use of Chinese remainder theorem codes over finite commutative rings
- Linear complementary pair of group 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₂+uF₂+u^2F₂
- Quantum cyclic codes over \( \mathbb{Z}_m \)
- Decoding of cyclic codes over the ring \(\frac{F_2[u]}{{\langle{u^t}\rangle }}\)
- A method for constructing self-dual codes over \(\mathbb {Z}_{2^m}\)
- LCD codes over finite chain rings
- A family of constacyclic codes over \(\mathbb F_{2} + u\mathbb F_{2} + v\mathbb F_{2} + uv\mathbb F_{2}\)
- Multivariable codes in principal ideal polynomial quotient rings with applications to additive modular bivariate codes over \(\mathbb{F}_4\)
- On quantum stabilizer codes derived from local Frobenius rings
- Matrix product codes over finite commutative Frobenius rings
- Repeated-root cyclic and negacyclic codes over a finite chain ring
- Lifted codes and their weight enumerators
- Fast computation of the rank profile matrix and the generalized Bruhat decomposition
- List decoding of convolutional codes over integer residue rings
- \(l\)-LIPs of 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\)
- Decomposing quasi-cyclic codes
- A note on characteristic generators of a free cyclic code and its dual
- Construction of extremal self-dual codes over \(\mathbb Z_8\) and \(\mathbb Z_{16}\)
- On LCD codes over finite chain rings
- scientific article; zbMATH DE number 4127151 (Why is no real title available?)
- Higher weights for codes over rings
- The dual of convolutional codes over \(\mathbb {Z}_{p^r}\)
- Isometries of the Hamming Space and Equivalence Relations of Linear Codes Over a Finite Field
- The classification of self-dual codes over Galois rings of length 4
- Computation of minimum Hamming weight for linear codes
- Entropy-based selection of cluster representatives for document image compression
- On MDS 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
- 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}\)
- Convolutional codes over finite chain rings, MDP codes and their characterization
- The homogeneous Gray image of linear codes over the Galois ring \(\mathrm{GR}(4, m)\)
- DNA multi-secret sharing schemes based on linear codes over \(\mathbb{Z}_4 \times R\)
- Representation and matrix-product structure of type-1 constacyclic codes over \(\mathbb{F}_{p^m}[u]/\langle u^e\rangle\)
- \( \mathbb{Z}_2 \mathbb{Z}_4\)-ACP of codes and their applications to the noiseless two-user binary adder channel
- Negacyclic self-dual codes over finite chain rings
- The maximum number of homogeneous weights of linear codes over chain rings
- Linear exact repair schemes for free MDS and Reed-Solomon codes over Galois rings
- Information set decoding for ring-linear codes
- MDS and self-dual codes over rings
- A class of locally recoverable codes over finite chain rings
- On symbol-pair distance distributions of repeated-root constacyclic codes of length 4p^s and MDS codes
- Self-orthogonal and quantum codes over chain rings
- A note on negacyclic self-dual codes over \(\mathbb Z_{2^{a}}\)
- Asymptotically good LCD 2-quasi-abelian codes over finite chain rings
- On the high density behavior of Hamming codes with fixed minimum distance
This page was built for publication: On the Hamming distance of linear codes over a finite chain ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503568)
