Sciweavers

364 search results - page 1 / 73
» Very Efficient Balanced Codes
Sort
View
JSAC
2010
132views more  JSAC 2010»
12 years 11 months ago
Very Efficient Balanced Codes
The prior art construction of sets of balanced codewords by Knuth is attractive for its simplicity and absence of look-up tables, but the redundancy of the balanced codes generated...
K. Schouhamer Immink, J. Weber
ICIP
1998
IEEE
14 years 6 months ago
Efficient Representation and Decoding of Static Huffman Code Tables in a Very Low Bit Rate Environment
The lossless entropy coding used in many image coding schemes often is overlooked as most research is based around the lossy stages of image compression. This paper examines the r...
Nick B. Body, Donald G. Bailey
ACM
1987
13 years 8 months ago
On efficient balanced codes
Balanced codes have the property that no codeword is "contained" in another.This property makes balanced codes attractive for certain applications, such as the encoding ...
Guan Jiwen, Victor R. Lesser
SIGMOD
1996
ACM
151views Database» more  SIGMOD 1996»
13 years 9 months ago
BIRCH: An Efficient Data Clustering Method for Very Large Databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely st,udied problems in this area is the identification of clusters...
Tian Zhang, Raghu Ramakrishnan, Miron Livny
TIT
2010
103views Education» more  TIT 2010»
12 years 11 months ago
Knuth's balanced codes revisited
Abstract--In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of "1"s and "01"s, called balanced ...
Jos H. Weber, Kees A. Schouhamer Immink