On the construction of an antidictionary with linear complexity using the suffix tree

T Ota, H Morita - IEICE transactions on fundamentals of electronics …, 2007 - search.ieice.org
The antidictionary of a string is the set of all words of minimal length that never appear in this
string. Antidictionaries are in particular useful for source coding. We present a fast and …

On the on-line arithmetic coding based on antidictionaries with linear complexity

T Ota, H Morita - 2007 IEEE International Symposium on …, 2007 - ieeexplore.ieee.org
This paper proposes an on-line data compression based on antidictionaries with linear time.
The proposed algorithm works using only suffix trees without constructing of antidictionaries …

[PDF][PDF] On-line electrocardiogram lossless compression using antidictionary-based methods

T Ota, H Morita - Third International Symposium on Medical …, 2009 - academia.edu
This paper proposes on-line electrocardiogram (ECG) lossless data compression based on
antidictionaries. An antidictionary is the set of all words of minimal length that never appear …

Multi-type arrhythmia classification with Antidictionary probability models

GA FRIAS PIMENTEL - uec.repo.nii.ac.jp
要 旨現代社会では全世界的なレベルで高齢化が急速に進んでおり, それに伴い,
死因が悪性新生物に次いで 2 番目に高い心疾患についても, 心臓病理学上のさまざまな不規則性 …

[PDF][PDF] Self-synchronizing reversible variable length codes

H Morita, DZ Sun - Proceeding of 2006 International Symposium on …, 2006 - academia.edu
A reversible variable-length code (RVLC) is a code in which the bit stream formed by a
portion of a codeword, or by the overlapped portion of two or more adjacent codewords, is …

[PDF][PDF] Antidictionary data compression using dynamic suffix trees

太田隆博, オオタタカヒロ - 2007 - core.ac.uk
Data compression is particularly useful in systems where resources are scarce, eg, limited
bandwidth in communication systems and the capacity of storage systems. A wide variety of …