Abstract
Two new proofs of the Delsarte inequalities for unrestricted codes over an arbitrary alphabet are presented. These inequalities are strengthened for the case that the size of the code is not divisible by the alphabet size.
Original language | English |
---|---|
Pages (from-to) | 197-217 |
Journal | Linear Algebra and Its Applications |
Volume | 269 |
Issue number | 1-3 |
DOIs | |
Publication status | Published - 1998 |