๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Dual distances of completely regular codes

โœ Scribed by B. Courteau; A. Montpetit

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
467 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis

Courteau, B. and A. Montpetit, Dual distances of completely regular codes, Discrete Mathematics 89 (1991) 7-15. In this paper we prove two theorems giving arithmetical constraints on the possible values of dual distances of completely regular codes extending some recent results of Calderbank and Gcethals. Nous demontrons deux theortmes donnant des contraintes arithmttiques sur les valeurs possibles des distances duales des codes completement rbguliers. Ces thcoremes gtneralisent certains resultats recents de Calderbank et Gmthals.

๐Ÿ“œ SIMILAR VOLUMES

Completely regular codes
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 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

A note on completely regular codes
A note on completely regular codes
โœ A.E. Brouwer ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 169 KB

We show that puncturing a completely regular even binary code produces a completely regular code again, thus answering a question posed in Brouwer et al. [3], p. 357.