This article is cited in 1 paper

Coding Theory

On lower bounds on the spectrum of a binary code

M. V. Burnashev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia

Abstract: 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.

Keywords: spectrum of a binary code, constant-weight code, undetected error probability.

UDC: 621.391.1 : 519.2

Received: 11.09.2019
Revised: 05.11.2019
Accepted: 12.11.2019

DOI: 10.1134/S055529231904003X

 English version: Problems of Information Transmission, 2019, 55:4, 366–375

Bibliographic databases:

• 
• 
•