On Hierarchical Type Covering

DOI10.1109/TIT.2005.859299zbMATH Open1318.94044OpenAlexW2173769989MaRDI QIDQ3547736FDOQ3547736

Authors: Ertem Tuncel, Jayanth Nayak, Kenneth Rose 

Publication date: 21 December 2008

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

Full work available at URL: https://doi.org/10.1109/tit.2005.859299

Recommendations

• Hierarchical guessing with a fidelity criterion
• Lossy asymptotic equipartition property for hierarchical data structures
• Hierarchical universal coding
• The method of types [information theory]
• A randomized covering-packing duality between source and channel coding

Mathematics Subject Classification ID

Source coding (94A29) Hierarchical games (including Stackelberg games) (91A65) Bounds on codes (94B65)

Cited In (2)

• Surplus extraction with rich type spaces
• Extensible encoding of type hierarchies

This page was built for publication: On Hierarchical Type Covering

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