Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes
From MaRDI portal
Publication:5124437
DOI10.1109/TIT.2020.2987309zbMath1446.94083OpenAlexW3016500741MaRDI QIDQ5124437
Mohammad Javad-Kalbasi, Mohammadali Khosravifard
Publication date: 29 September 2020
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2020.2987309
This page was built for publication: Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes