Code and parse trees for lossless source encoding
From MaRDI portal
Publication:1429270
DOI10.4310/CIS.2001.v1.n2.a1zbMath1055.94008OpenAlexW2329924640WikidataQ110511811 ScholiaQ110511811MaRDI QIDQ1429270
Publication date: 18 May 2004
Published in: Communications in Information and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4310/cis.2001.v1.n2.a1
Applications of graph theory (05C90) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Source coding (94A29)
Related Items (8)
Optimal Skeleton Huffman Trees Revisited ⋮ More Efficient Algorithms and Analyses for Unequal Letter Cost Prefix-Free Coding ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ On the cost of optimal alphabetic code trees with unequal letter costs ⋮ A combinatorial approach to Golomb forests ⋮ The \(S\)-digraph optimization problem and the greedy algorithm ⋮ New bounds on \(D\)-ary optimal codes
This page was built for publication: Code and parse trees for lossless source encoding
