Simple methods for deriving lower bounds the theory of codes

MaRDI QIDQ1190022zbMATH OpenFDO

Authors L. A. Bassalygo, M. S. Pinsker, Sergei Gelfand

Publication date 26 September 1992

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

zbMATH Keywords

asymptotic boundbinary error locating codes

Mathematics Subject Classification ID

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

Review text

See the review in Zbl 0752.94011.

Cited in

(3)

• A simpler proof of Jensen's coding theorem
• Separable collusion-secure multimedia codes
• A simple derivation of the coding theorem and some applications

This page was built for publication: Simple methods for deriving lower bounds the theory of codes

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