Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes

DOI10.1109/TIT.2020.2987309MaRDI QIDQ5124437zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Prefix, length-variable, comma-free codes (94A45)

Cited in

(4)

• On lower bounds for the redundancy of optimal codes
• On the redundancy of optimal binary prefix-condition codes for finite and infinite sources (Corresp.)
• Efficient and compact representations of some non-canonical prefix-free codes
• Bounding the inefficiency of length-restricted prefix codes

This page was built for publication: Some Tight Lower Bounds on the Redundancy of Optimal Binary Prefix-Free and Fix-Free Codes

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