AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY

By P. Delsarte. 2011

1,177 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/c026937ecfc5ccfcdf87b71aeac715178ccd5abb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Rank metric codes (2016, methodology): “The key idea of both proofs is the use of association schemes as pioneered by Delsarte [12].”
On ℤprℤps-additive codes (2015, methodology): “In 1973, based on association schemes Delsarte introduced the additive codes.[2,3] An additive code was defined as a subgroup of the underlying abelian group in a translation association scheme.”
Upper bounds for $s$-distance sets and equiangular lines (2016, methodology): “The approach using zonal spherical functions for finding packing bounds was introduced by Delsarte et al [22, 23] and then generalized by Kabatyansky and Levenshtein [40] to all compact two-point homogeneous spaces.”
Boolean Models and Methods in Mathematics, Computer Science, and Engineering: Boolean Functions for Cryptography and Error-Correcting Codes (2010, unknown): “This had been observed by Delsarte in [129, 130] (see also in a paper by J.”
The Structure of Z 2 Z 2 s-Additive Codes: Bounds on the Minimum Distance (2013, background): “Additive codes were first defined by Delsarte in 1973 in terms of association schemes [5, 6].”
Spectra of Graphs (2011, background): “The above definition is the original definition of Bose & Shimamoto [47]; it is what Delsarte [149] calls a symmetric association scheme.”
Hoffman's ratio bound (2021, background): “I have seen references to Delsarte [1], Lovász [7] and to the wrong paper of Hoffman [6].”
Variations on a Theme: Graph Homomorphisms (2013, result): “Originally proven in [11], this result has many different proofs including one which uses Cayley graphs that we will see later.”