DocumentCode
3301506
Title
On the adaptive antidictionary code using minimal forbidden words with constant lengths
Author
Ota, Takahiro ; Morita, Hiroyoshi
Author_Institution
Dept. of Electron. Eng., Nagano Prefectural Inst. of Technol., Nagano, Japan
fYear
2010
fDate
17-20 Oct. 2010
Firstpage
72
Lastpage
77
Abstract
This paper proposes a new on-line antidictionary code with linear time. The proposed algorithm uses a subset of antidictionary which length of the elements is at most a given fixed length. It is proved that the time complexity of this algorithm is linear with respect to the string length. Its effectiveness is demonstrated by simulation results.
Keywords
adaptive codes; communication complexity; adaptive antidictionary code; constant length; minimal forbidden word; time complexity; Adaptation model; Automata; Complexity theory; Decoding; Encoding; Heuristic algorithms; Probabilistic logic;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory and its Applications (ISITA), 2010 International Symposium on
Conference_Location
Taichung
Print_ISBN
978-1-4244-6016-8
Electronic_ISBN
978-1-4244-6017-5
Type
conf
DOI
10.1109/ISITA.2010.5649621
Filename
5649621
Link To Document