Classification of a class of distance-regular graphs via completely regular codes

@article{Rif1990ClassificationOA,
  title={Classification of a class of distance-regular graphs via completely regular codes},
  author={Josep Rif{\`a} and Ll. Huguet},
  journal={Discrete Applied Mathematics},
  year={1990},
  volume={26},
  pages={289-300}
}
Abstract The study of P -polynomial association schemes, or distance-regular graphs, and their possible classification is one of the main topics of algebraic combinatorics. One way to approach the issue is through the parameters p kij which characterize the scheme. The purpose of this paper is to deal with a concrete case. This case is also important in the study of the links between P -polynomial schemes and error-correcting codes. We present one way of constructing completely regular binary… CONTINUE READING

Figures and Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-6 OF 6 REFERENCES

Characterization of completely regular codes through P-polynomial association schemes, in: Lecture Notes in Computer Science 307

J. Rifa, L. Huguet
  • 1988

Equival&cies entre estructures combinatbricament regulars: Codis, Esquemes i grafs, Tesi doctoral

J. Rifh
  • Universitat Autbnoma de Barcelona
  • 1987

Algebraic Combinatorics I (Benjamin/Cummings

E. Bannai, T. Ito
  • 1984

On the nonexistence of perfect codes over finite fields

A. Tiettivsinen
  • SIAM J. Appl. Math
  • 1973