Supplement to: Code Spectrum and Reliability Function: Binary Symmetric Channel

TL;DR

This paper presents a simplified proof of a key theorem related to the code spectrum and reliability function for the binary symmetric channel, enhancing understanding and accessibility of the original results.

Contribution

It provides a much simpler proof of Theorem 1 from Burnashev's work, making the results more accessible and easier to understand.

Findings

Simplified proof of Theorem 1 in Burnashev's paper

Clarification of the relationship between code spectrum and reliability

Enhanced accessibility of theoretical results

Abstract

A much simpler proof of Theorem 1 from M.Burnashev "Code spectrum and reliability function: Binary symmetric channel" is presented.