A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances
From MaRDI portal
Publication:3540915
DOI10.1007/978-3-540-87448-5_1zbMath1167.94009OpenAlexW33658691MaRDI QIDQ3540915
Publication date: 25 November 2008
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87448-5_1
Cites Work
- The complete intersection theorem for systems of finite sets
- Contributions to the geometry of Hamming spaces
- A metric for codes over residue class rings
- The diametric theorem in Hamming spaces---optimal anticodes
- Attitude determination by Kalman filtering
- Design Methods for Maximum Minimum-Distance Error-Correcting Codes
- On $Z_{2^k}$-Dual Binary Codes
- Intersection theorems for systems of finite sets
- On a combinatorial conjecture of Erdös
- Algebraically punctured cyclic codes
- A pushing-pulling method: New proofs of intersection theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances