期刊名称：Electronic Colloquium on Computational Complexity
印刷版ISSN：1433-8092
出版年度：2002
卷号：2002
出版社：Universität Trier, Lehrstuhl für Theoretische Computer-Forschung
摘要：This paper presents new results on parallel constructions of the length-limited prefix-free codes with the minimum redundancy. We describe an algorithm for the construction of length-limited codes that works in O ( L ) time with n processors for L the maximal codeword length. We also describe an algorithm for a construction of {\it almost optimal length-limited codes} that works in O ( log n ) time with n processors. This is an optimal parallelization of the best known up to date sequential algorithm.
