A polynomial time algorithm for constructing optimal binary AIFV-2 codes

DOI10.1109/TIT.2023.3287587zbMATH Open1547.94227MaRDI QIDQ6574963FDOQ6574963

Authors Mordecai J. Golin, Elfarouk Harb 

Publication date 19 July 2024

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

zbMATH Keywords

geometric interpretationalmost optimal instantaneous fixed-to-variable (AIFV) codesbinary-search like procedureconstruction of optimal AIFV codespolynomially time-bounded procedurespace of binary AIFV-2 codes

Mathematics Subject Classification ID

Source coding (94A29)

This page was built for publication: A polynomial time algorithm for constructing optimal binary AIFV-2 codes

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