Title :
Combinatorial source encoding and perfect hashing
Author :
Krichevskii, R.E. ; Potapov, V.N.
Author_Institution :
Math. Inst., Novosibirsk State Univ., Russia
fDate :
27 Jun-1 Jul 1994
Abstract :
A combinatorial source is a subset S of a universum U. An encoding is an one-to-one map of S to the segment [0,...,|S|-1]. An encoding f is characterized by, first, its program complexity Pr(f) bits, second, its running time T(f) and, third, the precomputing time PT(f) bit operations required to transform S into a program of f. We present an encoding which is optimal by both first and second characteristics. Its precomputing time is polynomial in dictionary size, In that sense the problem is settled completely
Keywords :
combinatorial mathematics; computational complexity; cryptography; source coding; bit operations; combinatorial source encoding; dictionary size; perfect hashing; precomputing time; program complexity; running time; Books; Computer science; Dictionaries; Encoding; Entropy; Error correction codes; Galois fields; Polynomials; Reed-Solomon codes; Time measurement;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394699
