An equivalence of Ward’s bound and its application
- First Online:
- Cite this article as:
- Liu, X. Des. Codes Cryptogr. (2011) 58: 1. doi:10.1007/s10623-010-9380-1
- 65 Downloads
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.