Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes

DOI10.1109/TIT.2017.2694017zbMath1372.94484arXiv1607.07247OpenAlexW2963275264MaRDI QIDQ5369853

Weihua Hu, Hirosuke Yamamoto, Junya Honda

Publication date: 19 October 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.07247

Mathematics Subject Classification ID

Bounds on codes (94B65)

Related Items (1)

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using range minimum queries

This page was built for publication: Worst-case Redundancy of Optimal Binary AIFV Codes and Their Extended Codes