On the Delsarte inequalities
type: Item
instance of: scholarly article
title: On the Delsarte inequalities
zbMATH Open document ID: 0884.94022
DOI: 10.1016/S0024-3795(97)00065-7
published in: Linear Algebra and its Applications
publication date: 1998-04-15T00:00:00Z
review text: 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|\).
Mathematics Subject Classification ID: 94B05
Mathematics Subject Classification ID: 05A15
Mathematics Subject Classification ID: 05E30
zbMATH DE Number: 1100770
author: Alexei Ashikhmin
author: Juriaan Simonis
MaRDI profile type: Publication
cites work: Bounds for binary codes of length less than 25
cites work: Q3699606
cites work: Codes over \(\mathbb{Z}_{p^n}\) and association schemes
cites work: Q5707657
cites work: A simple proof of the Delsarte inequalities
cites work: Q3946078
description: scientific article; zbMATH DE number 1100770