Title :
Optimal prefix-free codes that end in a specified pattern and similar problems: the uniform probability case
Author :
Golin, Mordecai J. ; Na, HyeonSuk
Abstract :
In this paper we discuss the problem of constructing minimum-cost, prefix-free codes for equiprobable words under the assumption that all codewords are restricted to belonging to an arbitrary language L. We examine how, given certain types of L, the structure of the minimum-cost code changes as n, the number of codewords, grows
Keywords :
binary codes; combinatorial mathematics; deterministic automata; finite automata; probability; arbitrary language; codewords; deterministic finite automaton; equiprobable words; minimum-cost codes; optimal prefix-free codes; uniform probability case; Automata; Code standards; Computer science; Cost function; Doped fiber amplifiers; Mathematics; Probability distribution;
Conference_Titel :
Data Compression Conference, 2001. Proceedings. DCC 2001.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-7695-1031-0
DOI :
10.1109/DCC.2001.917145
