✦ LIBER ✦

Completely regular twographs

✍ Scribed by A. Neumaier

Book ID: 112511771
Publisher: Springer
Year: 1982
Tongue: English
Weight: 335 KB
Volume: 38
Category: Article
ISSN: 0003-889X
DOI: 10.1007/bf01304803

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Completely regular semigroups

✍ Peter G. Trotter 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 78 KB

Completely regular codes

✍ Arnold Neumaier 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 404 KB

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

Completely regular designs

✍ William J. Martin 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 215 KB

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

Regular and completely regular different

Regular and completely regular differential operators

✍ E. A. Shiryaev; A. A. Shkalikov 📂 Article 📅 2007 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 453 KB

Completely regular codes and completely

Completely regular codes and completely transitive codes

✍ Patrick Solé 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 511 KB

A binary code C is said to be completely regular if the weight distribution of any translate x + C depends only on the distance of x to C. Such codes are related to designs and distance regular graphs. Their covering radius is equal to their external distance. All perfect and uniformly packed codes

On completely regular semigroups

✍ O. Steinfeld 📂 Article 📅 1980 🏛 Springer 🌐 English ⚖ 84 KB