Journal ArticleDOI
Optimum extensions of prefix codes
Reads0
Chats0
TLDR
An algorithm is given for finding the minimum weight extension of a prefix code, which runs in O(n3), where n is the number of codewords to be added, and works for arbitrary alphabets.About:
This article is published in Information Processing Letters.The article was published on 1998-04-15. It has received 1 citations till now. The article focuses on the topics: Prefix code & Kraft's inequality.read more
Citations
More filters
Journal Article
Free-Extendible Prefix-Free Sets and an Extension of the Kraft-Chaitin Theorem
TL;DR: This work describes equivalent conditions for a finite prefix–free set to be indefinitely extendible and describes the influence of the alphabet size on the indefinite extensibility property.
References
More filters
Book
The Art of Computer Programming
TL;DR: The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Journal ArticleDOI
A Method for the Construction of Minimum-Redundancy Codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
A method for the construction of minimum-redundancy codes
TL;DR: A minimum-redundancy code is one constructed in such a way that the average number of coding digits per message is minimized.
Journal ArticleDOI
Geometric applications of a matrix-searching algorithm
TL;DR: The Θ(m) bound on finding the maxima of wide totally monotone matrices is used to speed up several geometric algorithms by a factor of logn.