Search Results - "Lempel-Ziv data compression algorithm"

Refine Results
  1. 1

    Fixed data base version of the Lempel-Ziv data compression algorithm by Wyner, A.D., Ziv, J.

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.05.1991
    Published in IEEE transactions on information theory (01.05.1991)
    “…It is demonstrated that a variant of the Lempel-Ziv data compression algorithm where the database is held fixed and is reused to encode successive strings of incoming input symbols is optimal…”
    Get full text
    Journal Article
  2. 2

    Traveling front solutions to directed diffusion-limited aggregation, digital search trees, and the Lempel-Ziv data compression algorithm by Majumdar, Satya N

    ISSN: 1539-3755
    Published: United States 01.08.2003
    “…We use the traveling front approach to derive exact asymptotic results for the statistics of the number of particles in a class of directed diffusion-limited…”
    Get full text
    Journal Article
  3. 3

    New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm by Bender, P.E., Wolf, J.K.

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.05.1991
    Published in IEEE transactions on information theory (01.05.1991)
    “…New results, which follow from a data compression algorithm proposed by A. Lempel and J. Ziv (1977), are presented. The authors describe the original Lempel-Ziv algorithm, and present an improved Lempel-Ziv data compression algorithm…”
    Get full text
    Journal Article
  4. 4
  5. 5

    Traveling Front Solutions to Directed Diffusion Limited Aggregation, Digital Search Trees and the Lempel-Ziv Data Compression Algorithm by Majumdar, Satya N

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 06.05.2003
    Published in arXiv.org (06.05.2003)
    “…We use the traveling front approach to derive exact asymptotic results for the statistics of the number of particles in a class of directed diffusion limited…”
    Get full text
    Paper
  6. 6

    An improved sliding window data compression algorithm based on the Lempel-Ziv data compression algorithm (magnetic recording) by Bender, P.E., Wolf, J.K.

    ISBN: 9780879426323, 0879426322
    Published: IEEE 1990
    “…A data compression scheme which can improve the efficiency of the Lempel-Ziv data compression algorithm is presented…”
    Get full text
    Conference Proceeding
  7. 7
  8. 8

    Fixed data base version of the Lempel-Ziv data compression algorithm by Wyner, A.D., Ziv, J.

    ISBN: 0818692022, 9780818692024
    Published: IEEE Comput. Soc. Press 1991
    “…It is demonstrated that a variant of the algorithm, where the data base is held fixed and is reused to encode successive strings of incoming input symbols, is…”
    Get full text
    Conference Proceeding
  9. 9

    Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines by Merhav, Neri

    ISSN: 0018-9448, 1557-9654
    Published: New York IEEE 01.05.2020
    Published in IEEE transactions on information theory (01.05.2020)
    “…Motivated by earlier results on universal randomized guessing, we consider an individual-sequence approach to the guessing problem: in this setting, the goal…”
    Get full text
    Journal Article
  10. 10

    Data compression and genomes: A two-dimensional life domain map by Menconi, Giulia, Benci, Vieri, Buiatti, Marcello

    ISSN: 0022-5193, 1095-8541, 1095-8541
    Published: England Elsevier Ltd 21.07.2008
    Published in Journal of theoretical biology (21.07.2008)
    “…–Ziv data compression algorithm. It is possible to use the statistics of the complexity values of the functional regions of different complete genomes to distinguish among genomes of different domains of life…”
    Get full text
    Journal Article
  11. 11

    Universal prediction of individual sequences by Feder, M., Merhav, N., Gutman, M.

    ISSN: 0018-9448
    Published: New York, NY IEEE 01.07.1992
    Published in IEEE transactions on information theory (01.07.1992)
    “… An efficient prediction procedure based on the incremental parsing procedure of the Lempel-Ziv data compression algorithm is shown to achieve asymptotically the FS predictability…”
    Get full text
    Journal Article
  12. 12

    A measure of relative entropy between individual sequences with application to universal classification by Ziv, J., Merhav, N.

    ISSN: 0018-9448
    Published: New York, NY IEEE 01.07.1993
    Published in IEEE transactions on information theory (01.07.1993)
    “… This empirical divergence is based on a version of the Lempel-Ziv data compression algorithm. A simple universal algorithm for classifying individual sequences into a finite number of classes, which is based on the empirical divergence, is introduced…”
    Get full text
    Journal Article
  13. 13

    Improved redundancy of a version of the Lempel-Ziv algorithm by Wyner, A.D., Wyner, A.J.

    ISSN: 0018-9448, 1557-9654
    Published: New York, NY IEEE 01.05.1995
    Published in IEEE transactions on information theory (01.05.1995)
    “…The Lempel-Ziv data compression algorithm has the property that for finite-memory sources the redundancy /spl rho//sub n…”
    Get full text
    Journal Article Conference Proceeding
  14. 14

    Asymptotic properties of data compression and suffix trees by Szpankowski, W.

    ISSN: 0018-9448
    Published: New York, NY IEEE 01.09.1993
    Published in IEEE transactions on information theory (01.09.1993)
    “…) log n in probability where h is the entropy of the alphabet. This finding was used to obtain several insights into certain universal data compression schemes, most notably the Lempel-Ziv data compression algorithm…”
    Get full text
    Journal Article
  15. 15

    The sliding-window Lempel-Ziv algorithm is asymptotically optimal by Wyner, A.D., Ziv, J.

    ISSN: 0018-9219
    Published: IEEE 01.06.1994
    Published in Proceedings of the IEEE (01.06.1994)
    “…The sliding-window version of the Lempel-Ziv data-compression algorithm (sometimes called LZ '77…”
    Get full text
    Journal Article
  16. 16

    Information-theoretic bounds on average signal transition activity [VLSI systems] by Ramprasad, S., Shanbhag, N.R., Hajj, I.N.

    ISSN: 1063-8210, 1557-9999
    Published: Piscataway, NJ IEEE 01.09.1999
    “… We also present a coding algorithm based on the Lempel-Ziv data-compression algorithm to achieve the bounds…”
    Get full text
    Journal Article
  17. 17

    Estimating the number of states of a finite-state source by Ziv, J., Merhav, N.

    ISSN: 0018-9448
    Published: New York, NY IEEE 01.01.1992
    Published in IEEE transactions on information theory (01.01.1992)
    “… The proposed estimator relies on the Lempel-Ziv data compression algorithm in an intuitively appealing manner.< >…”
    Get full text
    Journal Article
  18. 18

    On the estimation of the order of a Markov chain and universal data compression by Merhav, N., Gutman, M., Ziv, J.

    ISSN: 0018-9448
    Published: New York, NY IEEE 01.09.1989
    Published in IEEE transactions on information theory (01.09.1989)
    “… For the case where such a bound is unavailable, an alternative rule based on the Lempel-Ziv data compression algorithm is shown to be asymptotically optimal also…”
    Get full text
    Journal Article
  19. 19

    Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines by Neri Merhav

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 26.06.2019
    Published in arXiv.org (26.06.2019)
    “…Motivated by earlier results on universal randomized guessing, we consider an individual-sequence approach to the guessing problem: in this setting, the goal…”
    Get full text
    Paper
  20. 20

    Information-theoretic bounds on average signal transition activity VLSI systems by Ramprasad, S, Shanbhag, N R, Hajj, I N

    ISSN: 1063-8210
    Published: 01.09.1999
    “… We also present a coding algorithm based on the Lempel-Ziv data-compression algorithm to achieve the bounds…”
    Get full text
    Journal Article