Two-step encoding for finite sources
From MaRDI portal
Publication:4404779
DOI10.1109/TIT.1973.1055109zbMath0278.94011MaRDI QIDQ4404779
Publication date: 1973
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Information theory (general) (94A15) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (14)
On equistable, split, CIS, and related classes of graphs ⋮ Fredman–Komlós bounds and information theory ⋮ Almost all regular graphs are normal ⋮ Entropy of symmetric graphs ⋮ Line-graphs of cubic graphs are normal ⋮ The normal graph conjecture for two classes of sparse graphs ⋮ Disproving the normal graph conjecture ⋮ Symmetric graphs with respect to graph entropy ⋮ Perfect couples of graphs ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Constructions for normal graphs and some consequences ⋮ Probabilistic refinement of the asymptotic spectrum of graphs ⋮ On the odd cycles of normal graphs ⋮ Entropy splitting for antiblocking corners and perfect graphs
This page was built for publication: Two-step encoding for finite sources
