Addendum to "Code spectrum and the reliability function: Binary symmetric channel"

Authors:
M. V. Burnashev
Affiliations:
Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2007

Citing 2
Cited 1

Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric Channel

Problems of Information Transmission
Code spectrum and the reliability function: Binary symmetric channel

Problems of Information Transmission

Code spectrum and the reliability function: Gaussian channel

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

A much simpler proof of Theorem 1 from [1] is presented; we use the notation and enumeration of formulas of [1]. The text below replaces the subsection General Case in [1, Section 4, p. 271].