Huffman coding and chains in partition lattices
Loading...
Date
Authors
Foldes, Stephan
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky
ORCID
Altmetrics
Abstract
The Huffman coding algorithm is interpreted in the context of the lat-tice of partitions of the source alphabet. Maximal chains in the partition latticecorrespond to linear extensions of tree orders, and those among the chains thatexhibit a simple greedy property correspond precisely to executions of the Huffmanalgorithm
Description
Keywords
Citation
Mathematics for Applications. 2020 vol. 9, č. 2, s. 91-94. ISSN 1805-3629
http://ma.fme.vutbr.cz/archiv/9_2/ma_9_2_foldes_final.pdf
http://ma.fme.vutbr.cz/archiv/9_2/ma_9_2_foldes_final.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en