On the public citation graph
Improved redundancy of a version of the Lempel-Ziv algorithm
0 signed · 46 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1063/1.3062516openalex-snapshot
An Introduction to Probability Theory and Its Applications
inferredcites →https://doi.org/10.1109/18.45281openalex-snapshot
Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression
inferredcites →https://doi.org/10.1109/18.79942openalex-snapshot
New asymptotic bounds and improvements on the Lempel-Ziv data compression algorithm
inferredcites →https://doi.org/10.2307/2308599openalex-snapshot
An Introduction to Probability Theory and Its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11415770_22openalex-snapshot
Information Theoretic Approaches to Whole Genome Phylogenies
inferred← citeshttps://doi.org/10.1007/3-540-45723-2_20openalex-snapshot
Dynamic Topology Networks for Colour Image Compression
inferred← citeshttps://doi.org/10.1007/978-3-030-18576-3_12openalex-snapshot
SIRCS: Slope-intercept-residual Compression by Correlation Sequencing for Multi-stream High Variation Data
inferred← citeshttps://doi.org/10.1007/978-3-0348-7915-6_20openalex-snapshot
Using Tries for Universal Data Compression
inferred← citeshttps://doi.org/10.1007/978-3-319-32859-1_24openalex-snapshot
Compressing Big Data: When the Rate of Convergence to the Entropy Matters
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.019openalex-snapshot
On optimal parsing for LZ78-like compressors
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00308-6openalex-snapshot
Redundancy estimates for the Lempel–Ziv algorithm of data compression
inferred← citeshttps://doi.org/10.1023/a:1019999727252openalex-snapshot
Self-Organizing Dynamic Graphs
inferred← citeshttps://doi.org/10.1089/cmb.2006.13.336openalex-snapshot
The Average Common Substring Approach to Phylogenomic Reconstruction
inferred← citeshttps://doi.org/10.1093/bioinformatics/btu797openalex-snapshot
Exploiting hidden information interleaved in the redundancy of the genetic code without prior knowledge
inferred← citeshttps://doi.org/10.1109/18.532879openalex-snapshot
Match-length functions for data compression
inferred← citeshttps://doi.org/10.1109/18.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
inferred← citeshttps://doi.org/10.1109/18.605570openalex-snapshot
On the redundancy of the fixed-database Lempel-Ziv algorithm for φ-mixing sources
inferred← citeshttps://doi.org/10.1109/18.623144openalex-snapshot
The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm
inferred← citeshttps://doi.org/10.1109/18.650987openalex-snapshot
On the performance of data compression algorithms based upon string matching
inferred← citeshttps://doi.org/10.1109/18.661522openalex-snapshot
Redundancy of the Lempel-Ziv string matching code
inferred← citeshttps://doi.org/10.1109/18.705559openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement .III. Redundancy analysis
inferred← citeshttps://doi.org/10.1109/18.720530openalex-snapshot
On the role of pattern matching in information theory
inferred← citeshttps://doi.org/10.1109/18.761253openalex-snapshot
On the redundancy of lossy source coding with abstract alphabets
inferred← citeshttps://doi.org/10.1109/18.796370openalex-snapshot
An implementable lossy version of the Lempel-Ziv algorithm. I. Optimality for memoryless sources
inferred← citeshttps://doi.org/10.1109/18.904517openalex-snapshot
The redundancy of source coding with a fidelity criterion .II. Coding at a fixed rate level with unknown statistics
inferred← citeshttps://doi.org/10.1109/18.995542openalex-snapshot
Universal lossless source coding with the Burrows Wheeler transform
inferred← citeshttps://doi.org/10.1109/acssc.1997.679123openalex-snapshot
Second-order analysis of lossless and lossy versions of Lempel-Ziv codes
inferred← citeshttps://doi.org/10.1109/conit65521.2025.11167869openalex-snapshot
Adaptive Lempel-Ziv (LZ) Encoding for Diverse Inputs
inferred← citeshttps://doi.org/10.1109/dcc.1998.672138openalex-snapshot
Some theory and practice of greedy off-line textual substitution
inferred← citeshttps://doi.org/10.1109/dcc.1998.672213openalex-snapshot
Variable-to-fixed length codes for predictable sources
inferred← citeshttps://doi.org/10.1109/dcc.1999.755667openalex-snapshot
Universal lossless source coding with the Burrows Wheeler transform
inferred← citeshttps://doi.org/10.1109/icacsis.2015.7415159openalex-snapshot
Tandem repeats analysis in DNA sequences based on improved Burrows-Wheeler transform
inferred← citeshttps://doi.org/10.1109/isit.2002.1023395openalex-snapshot
On tries, suffix trees, and universal variable-length-to-block codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365096openalex-snapshot
On certain pathwise properties of the sliding-window lempel ziv algorithm
inferred← citeshttps://doi.org/10.1109/isit.2015.7282804openalex-snapshot
On redundancy rate of FDLZ algorithm and its variants
inferred← citeshttps://doi.org/10.1109/itw.2016.7606807openalex-snapshot
On point-wise redundancy rate of Bender-Wolf's variant of SWLZ algorithm
inferred← citeshttps://doi.org/10.1109/mbits.2025.3543321openalex-snapshot
On Jacob Ziv’s Individual-Sequence Approach to Information Theory
inferred← citeshttps://doi.org/10.1109/sequen.1997.666907openalex-snapshot
Compression of low entropy strings with Lempel-Ziv algorithms
inferred← citeshttps://doi.org/10.1109/tit.2002.1003819openalex-snapshot
Shannon theory: perspective, trends, and applications special issue dedicated to aaron d. wyner
inferred← citeshttps://doi.org/10.1109/tit.2006.885458openalex-snapshot
On Certain Pathwise Properties of the Sliding-Window Lempel–Ziv Algorithm
inferred← citeshttps://doi.org/10.1121/1.2161827openalex-snapshot
Information entropy of humpback whale songs
inferred← citeshttps://doi.org/10.1137/s0097539797331105openalex-snapshot
Compression of Low Entropy Strings with Lempel--Ziv Algorithms
inferred← citeshttps://doi.org/10.14209/sbrt.2005.509openalex-snapshot
Transmissão de Informação Embutida em Arquivos Comprimidos com o Algoritmo LZW
inferred← citeshttps://doi.org/10.3390/entropy-e10020071openalex-snapshot
Estimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation Study
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.