On lower bounds on the spectrum of a binary code

DOI10.1134/S0032946019040033zbMath1467.94046OpenAlexW3003090216WikidataQ126292897 ScholiaQ126292897MaRDI QIDQ2190925

Marat V. Burnashev

Publication date: 23 June 2020

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0032946019040033

zbMATH Keywords

constant-weight codeundetected error probabilityspectrum of a binary code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Related Items (1)

New upper bounds in the hypothesis testing problem with information constraints

Cites Work

• On the BSC reliability function: expanding the region where it is known exactly
• Code spectrum and the reliability function: binary symmetric channel
• Straight-line bound for the undetected error exponent
• Sharpening of an upper bound for the reliability function of a binary symmetric channel
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On Some Testing of Hypothesis Problems with Information Constraints
• New upper bounds on error exponents
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On lower bounds on the spectrum of a binary code