On bounds for codes over Frobenius rings under homogeneous weights
From MaRDI portal
Publication:1763332
DOI10.1016/j.disc.2004.10.002zbMath1082.94022OpenAlexW2148539356MaRDI QIDQ1763332
Marcus Greferath, Michael E. O'Sullivan
Publication date: 22 February 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.002
Related Items (8)
Induced weights on quotient modules and an application to error correction in coherent networks ⋮ New bounds for codes over finite Frobenius rings ⋮ The linear programming bound for codes over finite Frobenius rings ⋮ Density of free modules over finite chain rings ⋮ Negacyclic codes over Galois rings of characteristic \(2^a\) ⋮ Cyclic codes over \({\mathbb{F}}_2 + u{\mathbb{F}}_2 + v{\mathbb{F}}_2 + uv{\mathbb{F}}_2\) ⋮ Partitions of Frobenius rings induced by the homogeneous weight ⋮ ON PLOTKIN-OPTIMAL CODES OVER FINITE FROBENIUS RINGS
Cites Work
- Unnamed Item
- Unnamed Item
- On the asymptotic behaviour of Lee-codes
- A new upper bound on nonbinary block codes
- A metric for codes over residue class rings
- On upper bounds for minimum distance and covering radius of non-binary codes
- Finite-ring combinatorics and MacWilliams' equivalence theorem
- An Elias-type bound for Lee codes over large alphabets and its application to perfect codes (Corresp.)
- Duality for modules over finite rings and applications to coding theory
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
- A Z/sub 8/-linear lift of the binary Golay code and a nonlinear binary (96,2/sup 37/,24)-code
- An upper bound on the volume of discrete spheres
- Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces
- Characterization of finite Frobenius rings
This page was built for publication: On bounds for codes over Frobenius rings under homogeneous weights
