Completely regular algebraic monoids
โ Scribed by Lex E. Renner
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 438 KB
- Volume
- 59
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
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 de
Neumaier, A., Completely regular codes, Discrete Mathematics 106/107 (1992) 353-360 Completely regular codes are a large class of codes which share many of the most interesting properties of perfect codes. This paper shows that the basic theory-including Lloyd's theorem+an be obtained very elegantly