Abstract
We present the diametric theorem for additive anticodes with respect to the Lee distance in \({\mathbb Z}^n_{2^k}\), where \({\mathbb Z}_{2^k}\) is an additive cyclic group of order 2k. We also investigate optimal anticodes in \({\mathbb Z}^n_{p^k}\) for the homogeneous distance and in \({\mathbb Z}^n_m\) for the Krotov-type distance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ahlswede, R.: Another diametric theorem in Hamming spaces: optimal group anticodes. In: Proc. IEEE Information Theory Workshop, Punta del Este, Uruguay, March 13-17, 2006, pp. 212–216 (2006)
Ahlswede, R., Katona, G.: Contributions to the geometry of Hamming spaces. Discrete Mathematics 17, 1–22 (1977)
Ahlswede, R., Khachatrian, L.: The complete intersection theorem for systems of finite sets. European J. Combinatorics 18, 125–136 (1997)
Ahlswede, R., Khachatrian, L.: The diametric theorem in Hamming spaces -optimal anticodes. Adv. Appl. Math. 20, 429–449 (1998)
Ahlswede, R., Khachatrian, L.: A pushing-pulling method: New proofs of intersection theorems. Combinatorica 19, 1–15 (1999)
Belov, B.I., Logachev, V.N., Sandimorov, V.P.: Construction of a class of linear binary codes achieving the Varshamov-Griesmer bound. Problemy Peredachi Informatsii 10(3), 36–44 (1974)
Constantinescu, I., Heise, W.: A metric for codes over residue class rings of integers. Probl. Inform. Transm. 33(3), 208–213 (1997)
Farrell, P.G.: Linear binary anticodes. Electronics Letters 6, 419–421 (1970)
Katona, G.: Intersection theorems for systems of finite sets. Acta Math. Acad. Sci. Hung. 15, 329–337 (1964)
Kleitman, D.: On a combinatorial conjecture of Erdös. J. Combin. Theory 1, 209–214 (1966)
Krotov, D.S.: ℤ4-linear perfect codes. Diskr. Analiz Issled. Oper., Ser. 1, 7(4), 78–90 (2000) (in Russian)
Krotov, D.S.: ℤ4-linear Hadamard and extended perfect codes. Electronic Notes in Discrete Mathematics 6, 107–112 (2001)
Krotov, D.S.: On ℤ_2k-dual binary codes. IEEE Trans. Inform. Theory 53(4), 1532–1537 (2007)
MacDonald, J.E.: Design for maximmum minimum-distance error-correcting codes. IBM J. Res. Develop. 4(1), 43–57 (1960)
MacWilliams, F.J., Sloane, N.J.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Solomon, G., Stiffler, I.I.: Algebraically punctured cyclic codes. Information and Control 8(2), 170–179 (1965)
Venturini, D.: Construction of maximum linear binary codes in the case of large distances. Problems of Cybernetics 16, 231–238 (1966) (in Russian)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ahlswede, R., Solov’eva, F.I. (2008). A Diametric Theorem in \({\mathbb Z}^n_m\) for Lee and Related Distances. In: Barbero, Á. (eds) Coding Theory and Applications. Lecture Notes in Computer Science, vol 5228. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87448-5_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-87448-5_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87447-8
Online ISBN: 978-3-540-87448-5
eBook Packages: Computer ScienceComputer Science (R0)