Optimal Prefix Free Codes with Partial Sorting.
From MaRDI portal
Publication:5369564
DOI10.4230/LIPICS.CPM.2016.29zbMath1380.68460arXiv1602.00023OpenAlexW2964115797MaRDI QIDQ5369564
Publication date: 17 October 2017
Full work available at URL: https://arxiv.org/abs/1602.00023
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Prefix, length-variable, comma-free codes (94A45) Algorithms on strings (68W32)
This page was built for publication: Optimal Prefix Free Codes with Partial Sorting.
