Bounds for codes in the case of list decoding of finite volume
From MaRDI portal
Publication:1090661
zbMath0621.94018MaRDI QIDQ1090661
Publication date: 1986
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (8)
Erasures versus errors in local decoding and property testing ⋮ Unnamed Item ⋮ Multiple packing in sum-type metric spaces ⋮ On metric properties of maps between Hamming spaces and related graph homomorphisms ⋮ List decoding ⋮ List decodability at small radii ⋮ Unnamed Item ⋮ Lower bound for the linear multiple packing of the binary Hamming space
This page was built for publication: Bounds for codes in the case of list decoding of finite volume
