On the Delsarte inequalities (Q1375529): Difference between revisions

For the authors, a code \(C\) is a multiset of elements of \(F^s\). They present two new proofs of the Delsarte inequalities [cf. \textit{P. Delsarte}, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl. 10 (1973)]. These inequalities are strengthened for the case that \(|C|\) is not divisible by \(|F|\).