scientific article; zbMATH DE number 3970683

MaRDI QIDQ3737375zbMATH OpenFDO

Authors Vladimir Blinovsky

Publication date 1986

Mathematics Subject Classification ID

Decoding (94B35)

Recommendations

• Bounds for codes in the case of list decoding of finite volume
• Publication:4945066
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• List decoding
• Combinatorial bounds for list decoding

Cited in

(11)

• Bounds for codes in the case of list decoding of finite volume
• New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels
• Code volume boundaries in the additive channel
• Lovász, vectors, graphs and codes
• An upper bound on the volume of discrete spheres
• scientific article; zbMATH DE number 1420994 (Why is no real title available?)
• Generalized Singleton Bound and List-Decoding Reed–Solomon Codes Beyond the Johnson Radius
• Singleton-type bounds for list-decoding and list-recovery, and related results
• Point-polynomial incidences theorem with an application to Reed-Solomon codes
• Codes for adversaries: between worst-case and average-case jamming
• List decodability at small radii

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3737375)