An efficient algorithm for constructing nearly optimal prefix codes
From MaRDI portal
Publication:3882330
DOI10.1109/TIT.1980.1056250zbMath0439.94017OpenAlexW2102824199MaRDI QIDQ3882330
Publication date: 1980
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1980.1056250
Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24)
Related Items (1)
This page was built for publication: An efficient algorithm for constructing nearly optimal prefix codes