On the adaptive antidictionary code using minimal forbidden words with constant lengths

Takahiro Ota, Hiroyoshi Morita · 2010

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.

Read the paper · More papers on PaperTik