New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels

DOI10.1134/S0032946021040013zbMath1493.94019OpenAlexW4206079954MaRDI QIDQ2068820

D. Yu. Goshkoder, Arkadii G. D'yachkov

Publication date: 20 January 2022

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

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

zbMATH Keywords

discrete memoryless channellist decodingbinary symmetric channelexpurgation boundZ-channelfraction of correctable errors

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bound on error probability in fixed-volume list decoding
• Coding with noiseless feedback over the Z-channel
• Error-correcting codes for list decoding

This page was built for publication: New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels