On Lower Bounds on the Spectrum of a Binary Code


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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.

About the authors

M. V. Burnashev

Kharkevich Institute for Information Transmission Problems

Author for correspondence.
Email: burn@iitp.ru
Russian Federation, Moscow

Supplementary files

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Pleiades Publishing, Inc.