scientific article; zbMATH DE number 3970683

zbMATH Open0601.94016MaRDI QIDQ3737375FDOQ3737375

Authors: Vladimir Blinovsky 

Publication date: 1986

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Decoding (94B35)

Cited In (8)

• Code volume boundaries in the additive channel
• List decodability at small radii
• 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
• New lower bounds on the fraction of correctable errors under list decoding in combinatorial binary communication channels
• Lovász, vectors, graphs and codes
• Title not available (Why is that?)
• Bounds for codes in the case of list decoding of finite volume

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)