On Lower Bounds on the Spectrum of a Binary Code

We refine a lower bound on the spectrum of a binary code. We give a simple derivation of the known bound on the undetected error probability of a binary code.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Problems of information transmission 2019-10, Vol.55 (4), p.366-375
1. Verfasser:	Burnashev, M. V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Binary codes Codes Coding Theory Communications Engineering Control Electrical Engineering Engineering Information Storage and Retrieval Lower bounds Networks Systems Theory
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We refine a lower bound on the spectrum of a binary code. We give a simple derivation of the known bound on the undetected error probability of a binary code.
ISSN:	0032-9460 1608-3253
DOI:	10.1134/S0032946019040033