Università di Pisa
Sistema bibliotecario di ateneo

On a simple storage scheme for strings achieving entropy bounds

Ferragina, Paolo and Venturini, Rossano (2006) On a simple storage scheme for strings achieving entropy bounds. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] PDF (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (185Kb)


    In this note we propose a storage scheme for a string S[1,n], drawn from an alphabet A, that requires space close to the k-th order empirical entropy of S and allows to retrieve any L-long substring of S in optimal O(1 + L log A/log n) time. This matches the best known bounds via the only use of binary encodings and tables.

    Item Type: Book
    Uncontrolled Keywords: data compression, string access, empirical entropy
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 09 Dec 2014 13:06
    Last Modified: 09 Dec 2014 13:06
    URI: http://eprints.adm.unipi.it/id/eprint/2162

    Repository staff only actions

    View Item