A polynomial time algorithm for constructing optimal binary AIFV-2 codes
From MaRDI portal
Publication:6574963
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)
geometric interpretationalmost optimal instantaneous fixed-to-variable (AIFV) codesbinary-search like procedureconstruction of optimal AIFV codespolynomially time-bounded procedurespace of binary AIFV-2 codes
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)
