Skip to Main content Skip to Navigation
Conference papers

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

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.
Complete list of metadata

Cited literature [4 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184213
Contributor : Coordination Episciences Iam <>
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

dmAD0137.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184213, version 1

Collections

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. ⟨hal-01184213⟩

Share

Metrics

Record views

78

Files downloads

574