论文信息 - Completely regular designs

Completely regular designs

We study a class of t-designs which enjoy a high degree of regularity. These are the subsets of vertices of the Johnson graph which are completely regular, in the sense of Delsarte [Philips Res. Reports Suppl. 10 (1973)]. After setting up the basic theory, we describe the known completely regular designs. We derive very strong restrictions which must hold in order for a design to be completely regular. As a result, we are able to determine which symmetric designs are completely regular and which Steiner systems with t = 2 are completely regular. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 261–273, 1998

William J. Martin | W. Martin

[1] J. Koolen. On a conjecture of Martin on the parameters of completely regular codes and the classification of the completely regular codes in the biggs-smith graph , 1995 .

[2] Tuvi Etzion. On the Nonexistence of Perfect Codes in the Johnson Scheme , 1996, SIAM J. Discret. Math..

[3] William J. Martin,et al. Designs in Product Association Schemes , 1999, Des. Codes Cryptogr..

[4] Philippe Delsarte,et al. Four Fundamental Parameters of a Code and Their Combinatorial Significance , 1973, Inf. Control..

[5] Kees Roos. A note on the existence of perfect constant weight codes , 1983, Discret. Math..

[6] P. Delsarte. Hahn Polynomials, Discrete Harmonics, and t-Designs , 1978 .

[7] Arnold Neumaier,et al. Completely regular codes , 1992, Discret. Math..

[8] Chris D. Godsil,et al. ALGEBRAIC COMBINATORICS , 2013 .

[9] William J. Martin,et al. Completely Regular Designs of Strength One , 1994 .

[10] M. W. Wilson,et al. On the Hahn Polynomials , 1970 .