Abstract
It is well known that the MacWilliams transform of the weight enumerator of some code having integer coefficients is equivalent to a set of congruences having integer solutions. In this paper, we prove an equivalent condition of Ward’s bound on dimension of divisible codes, which is part of this set of congruences having integer solutions. This new interpretation makes the generalization of Ward’s bound an explicit one.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Kim J.-L., Liu X.: Ageneralized Gleason-Pierce-Ward theorem. Des. Codes Cryptogr. 52, 363–380 (2009)
Uspensky J.V., Heaslit M.A.: Elementary Number Theory. McGraw-Hill, New York (1939)
Van Lint J.H., Wilson R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)
Ward H.N.: Divisible codes. Arch. Math. 36, 485–499 (1981)
Ward H.N.: A bound for divisible codes. IEEE Trans. Inform. Theory 38, 191–194 (1992)
Ward H.N.: The divisible code bound revisited. J. Combin. Theory A 94, 34–50 (2001)
Wilson R.M.: A lemma on polynomials modulo p m and applications to coding theory. Discrete Math. 306, 3154–3165 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by R. Hill.
Rights and permissions
About this article
Cite this article
Liu, X. An equivalence of Ward’s bound and its application. Des. Codes Cryptogr. 58, 1–9 (2011). https://doi.org/10.1007/s10623-010-9380-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-010-9380-1