A Diametric Theorem in {\mathbb Z}^n_m for Lee and Related Distances

DOI10.1007/978-3-540-87448-5_1MaRDI QIDQ3540915zbMATH OpenOpenAlexFDO

Authors Faina I. Solov'eva, Rudolf Ahlswede

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

Mathematics Subject Classification ID

Extremal set theory (05D05) Other types of codes (94B60)

Recommendations

• The diametric theorem in Hamming spaces---optimal anticodes
• A generalization of the Lee distance and error correcting codes
• On the largest dimension of anticodes
• On maximum Lee distance codes
• Optimal tristance anticodes in certain graphs

Cites work

• scientific article; zbMATH DE number 1811351 (Why is no real title available?)
• scientific article; zbMATH DE number 3497775 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 3322463 (Why is no real title available?)
• A metric for codes over residue class rings
• A pushing-pulling method: New proofs of intersection theorems
• Algebraically punctured cyclic codes
• Attitude determination by Kalman filtering
• Contributions to the geometry of Hamming spaces
• Design Methods for Maximum Minimum-Distance Error-Correcting Codes
• Intersection theorems for systems of finite sets
• On $Z_{2^k}$-Dual Binary Codes
• On a combinatorial conjecture of Erdös
• The complete intersection theorem for systems of finite sets
• The diametric theorem in Hamming spaces---optimal anticodes
• \(Z_4\)-linear Hadamard and extended perfect codes

Cited in

(1)

• Optimal tristance anticodes in certain graphs

This page was built for publication: A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540915)