Two-step encoding for finite sources

DOI10.1109/TIT.1973.1055109MaRDI QIDQ4404779zbMATH OpenFDO

Authors János Körner, Giuseppe Longo

Publication date 1973

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

Full work available at URL https://doi.org/10.1109/TIT.1973.1055109

Mathematics Subject Classification ID

Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)

Cited in

(14)

• Constructions for normal graphs and some consequences
• Perfect couples of graphs
• On the odd cycles of normal graphs
• The normal graph conjecture for two classes of sparse graphs
• Some bounds of weighted entropies with augmented Zagreb index edge weights
• Probabilistic refinement of the asymptotic spectrum of graphs
• Disproving the normal graph conjecture
• Almost all regular graphs are normal
• Line-graphs of cubic graphs are normal
• On equistable, split, CIS, and related classes of graphs
• Fredman–Komlós bounds and information theory
• Symmetric graphs with respect to graph entropy
• Entropy splitting for antiblocking corners and perfect graphs
• Entropy of symmetric graphs

This page was built for publication: Two-step encoding for finite sources

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