Huffman coding and chains in partition lattices

dc.contributor.author	Foldes, Stephan
dc.coverage.issue	2	cs
dc.coverage.volume	9	cs
dc.date.accessioned	2021-07-02T10:21:18Z
dc.date.available	2021-07-02T10:21:18Z
dc.date.issued	2020	cs
dc.description.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	en
dc.format	text	cs
dc.format.extent	91-94	cs
dc.format.mimetype	application/pdf	en
dc.identifier.citation	Mathematics for Applications. 2020 vol. 9, č. 2, s. 91-94. ISSN 1805-3629	cs
dc.identifier.doi	10.13164/ma.2020.08	en
dc.identifier.issn	1805-3629
dc.identifier.uri	http://hdl.handle.net/11012/200391
dc.language.iso	en	cs
dc.publisher	Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky	cs
dc.relation.ispartof	Mathematics for Applications	en
dc.relation.uri	http://ma.fme.vutbr.cz/archiv/9_2/ma_9_2_foldes_final.pdf	cs
dc.rights	© Vysoké učení technické v Brně, Fakulta strojního inženýrství, Ústav matematiky	cs
dc.rights.access	openAccess	en
dc.title	Huffman coding and chains in partition lattices	en
dc.type.driver	article	en
dc.type.status	Peer-reviewed	en
dc.type.version	publishedVersion	en
eprints.affiliatedInstitution.department	Ústav matematiky	cs
eprints.affiliatedInstitution.faculty	Fakulta strojního inženýrství	cs

Now showing 1 - 1 of 1