Dynamic asymmetric communication
From MaRDI portal
Publication:975489
DOI10.1016/J.IPL.2008.07.004zbMATH Open1191.68293OpenAlexW2011648667MaRDI QIDQ975489FDOQ975489
Publication date: 9 June 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2008.07.004
Online algorithms; streaming algorithms (68W27) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cites Work
- A Mathematical Theory of Communication
- A locally adaptive data compression scheme
- Universal codeword sets and representations of the integers
- Design and analysis of dynamic Huffman codes
- Protocols for asymmetric communication channels
- Improved bounds for asymmetric communication protocols.
- Lower bounds for asymmetric communication channels and distributed source coding
- Asymmetric communication protocols via hotlink assignments
- Collecting correlated information from a sensor network
Cited In (6)
Recommendations
This page was built for publication: Dynamic asymmetric communication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975489)