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

A Note on Greedy Codes

โœ Scribed by D. Fon-Der-Flaass

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
214 KB
Volume
76
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis

In their paper (J. Combin. Theory Ser. A 64 (1993), 10 30) Brualdi and Pless prove linearity of some binary codes obtained by a greedy algorithm and establish lower bounds for the dimension of these codes. In this note, we show that actually they have proved a much more general result, and show that these codes also satisfy the Varshamov Gilbert bound.

๐Ÿ“œ SIMILAR VOLUMES

Greedy codes
Greedy codes
โœ Richard A Brualdi; Vera S Pless ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 837 KB
On a personal note governance codes
On a personal note governance codes
โœ John Carver; Miriam Carver ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› John Wiley and Sons โš– 249 KB ๐Ÿ‘ 2 views
A note on self-orthogonal codes
A note on self-orthogonal codes
โœ Alexander Pott ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 124 KB
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.