Skip to Main content Skip to Navigation
Conference papers

A tight upper bound on the size of the antidictionary of a binary string

Hiroyoshi Morita 1 Takahiro Ota 2 
1 UEC - University of Electro-Communications [Tokyo]
2 Department of Electronic Engineering
Abstract : A tight upper bound of the size of the antidictionary of a binary string is presented. And it is shown that the size of the antidictionary of a binary sting is always smaller than or equal to that of its dictionary. Moreover, an algorithm to reconstruct its dictionary from its antidictionary is given.
Keywords : antidictionary minimum forbidden words suffix trees data compression ECG
Document type :
Conference papers
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download
https://hal.inria.fr/hal-01184213
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 13, 2015 - 1:34:34 PM
Last modification on : Thursday, May 11, 2017 - 1:03:09 AM
Long-term archiving on: : Saturday, November 14, 2015 - 10:22:42 AM

File

Vignette du document
dmAD0137.pdf
Publisher files allowed on an open archive

Identifiers

Collections

INSMI | TDS-MACS

Citation

Hiroyoshi Morita, Takahiro Ota. A tight upper bound on the size of the antidictionary of a binary string. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.393-398, ⟨10.46298/dmtcs.3378⟩. ⟨hal-01184213⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

29

Files downloads

371

 

Contact                    Legal Notice                    Personal Data