The random coding bound is tight for the average code (Corresp.)

From MaRDI portal

Revision as of 04:23, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5665104

Jump to:navigation, search

DOI10.1109/TIT.1973.1054971zbMath0251.94012MaRDI QIDQ5665104

Robert G. Gallager

Publication date: 1973

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (3)

Density of free modules over finite chain rings ⋮ Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources ⋮ Reed-Muller Codes

This page was built for publication: The random coding bound is tight for the average code (Corresp.)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5665104&oldid=30361453"