Minimum Distance Bounds for s-Regular Codes

Designs, Codes, and Cryptography

Volumn 21, Issue 1-3, 2000, Pages 181-187

  Martin, William J ^a  

^a UNIVERSITY OF WINNIPEG   (Canada)

Author keywords

Completely regular codes; Error correcting codes; Fundamental parameters; Hamming graph

Indexed keywords

EID: 0346742361     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008395813214     Document Type: Article

References (7)

1. A. E. Brouwer, A. M. Cohen and A. Neumaier, Distance-Regular Graphs, Springer-Verlag, Berlin (1989).
2. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Repts. Suppl., Vol. 10 (1973).
3. P. Delsarte, Association schemes and t-designs in regular semilattices, J. Combin. Th., Ser. A, Vol. 20 (1976) pp. 230-243.
4. C. D. Godsil, Algebraic Combinatorics, Chapman and Hall, New York (1993).
5. J. M. Goethals and H. C. A. van Tilborg, Uniformly packed codes, Philips Res. Repts., Vol. 30 (1975) pp. 9-36.
6. W. J. Martin, Completely regular designs of strength one, J. Alg. Combin., Vol. 3 (1994) pp. 177-185.
7. A. Neumaier, Completely regular codes, Discrete Math., Vol. 106/107 (1992) pp. 353-360.