Bounds and algorithms for alphabetic codes and binary search trees

DOI10.1109/TIT.2024.3428699MaRDI QIDQ6670169zbMATH OpenFDO

Authors Roberto Bruno, Roberto De Prisco, Alfredo De Santis, Ugo Vaccaro

Publication date 23 January 2025

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

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

This page was built for publication: Bounds and algorithms for alphabetic codes and binary search trees

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