Improved bounds for asymmetric communication protocols.

DOI10.1016/S0020-0190(01)00332-5zbMath1043.68015MaRDI QIDQ1853071

Leonardo Gomes Holanda, Eduardo Sany Laber

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Analysis of algorithmsData compressionAsymmetric communicationWireless networking

Mathematics Subject Classification ID

Network protocols (68M12) Communication theory (94A05) Coding theorems (Shannon theory) (94A24)

Related Items

An approximation algorithm for binary searching in trees ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Dynamic hotlinks ⋮ Dynamic asymmetric communication

Cites Work

• A Mathematical Theory of Communication
• Protocols for asymmetric communication channels
• A Method for the Construction of Minimum-Redundancy Codes