An extremal problem related to the covering radius of binary codes
We introduce an extremal problem akin to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible covering radius; we solve the problem in some cases, give some bounds, and also show how it relates to the construction of good codes with distance 3.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | We introduce an extremal problem akin to the search for the parameters of binary linear codes of minimal distance 3 and the largest possible covering radius; we solve the problem in some cases, give some bounds, and also show how it relates to the construction of good codes with distance 3. |
|---|---|
| ISSN: | 0302-9743 1611-3349 |
| DOI: | 10.1007/BFb0034339 |