On the public citation graph

Universal lossless data compression with side information by using a conditional MPM grammar transform

0 signed · 60 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/0471200611openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/3-540-46665-7_31openalex-snapshot
Fast and Space-Efficient Adaptive Arithmetic Coding⋆
inferredcites →https://doi.org/10.1007/978-1-4757-6048-4_36openalex-snapshot
Universal Lossless Coding of Sources with Large and Unbounded Alphabets
inferredcites →https://doi.org/10.1007/978-3-0348-8645-1_7openalex-snapshot
Elements of Information Theory
inferredcites →https://doi.org/10.1007/bf02837777openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1093/bioinformatics/17.2.149openalex-snapshot
An information-based sequence distance and its application to whole mitochondrial genome phylogeny
inferredcites →https://doi.org/10.1109/18.108250openalex-snapshot
Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
inferredcites →https://doi.org/10.1109/18.52489openalex-snapshot
Linear time adaptive arithmetic coding
inferredcites →https://doi.org/10.1109/18.567640openalex-snapshot
Average redundancy rate of the Lempel-Ziv code
inferredcites →https://doi.org/10.1109/18.75241openalex-snapshot
Sample converses in source coding theory
inferredcites →https://doi.org/10.1109/18.841160openalex-snapshot
Grammar-based codes: a new class of universal lossless source codes
inferredcites →https://doi.org/10.1109/18.841161openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform. I. Without context models
inferredcites →https://doi.org/10.1109/18.850665openalex-snapshot
Universal lossless compression via multilevel pattern matching
inferredcites →https://doi.org/10.1109/icip.2000.901124openalex-snapshot
Resolution scalable lossless progressive image coding via conditional quadrisection
inferredcites →https://doi.org/10.1109/isit.1995.535781openalex-snapshot
A sliding window Lempel-Ziv algorithm for differential layer encoding in progressive transmission
inferredcites →https://doi.org/10.1109/itcom.1999.781414openalex-snapshot
Universal source coding theory based on grammar transforms
inferredcites →https://doi.org/10.1109/tit.1976.1055607openalex-snapshot
The zero-error side information problem and chromatic numbers (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1978.1055934openalex-snapshot
Compression of individual sequences via variable-rate coding
inferredcites →https://doi.org/10.1109/tit.1984.1056878openalex-snapshot
Fixed-rate encoding of individual sequences with side information
inferredcites →https://doi.org/10.1109/tit.1985.1057068openalex-snapshot
Universal decoding for finite-state channels
inferredcites →https://doi.org/10.1109/tit.2003.818411openalex-snapshot
Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform-part two: with context models
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.5555/338219.338586openalex-snapshot
Estimating DNA sequence entropy

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s10462-017-9551-9openalex-snapshot
A review on document image analysis techniques directly in the compressed domain
inferred← citeshttps://doi.org/10.1007/s10796-006-8777-xopenalex-snapshot
A data mining approach to database compression
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797621openalex-snapshot
Low-density linear IED schemes for lossless source coding with decoder only side information
inferred← citeshttps://doi.org/10.1109/allerton.2009.5394496openalex-snapshot
Interactive encoding and decoding based on syndrome accumulation over binary LDPC ensembles: Universality and rate-adaptivity
inferred← citeshttps://doi.org/10.1109/ccece.2004.1347695openalex-snapshot
Algorithms for estimating information distance with application to bioinformatics and linguistics
inferred← citeshttps://doi.org/10.1109/chinacom.2008.4684976openalex-snapshot
Two results on interactive lossless source encoding and decoding with side information at the decoder
inferred← citeshttps://doi.org/10.1109/cwit.2009.5069517openalex-snapshot
Interactive encoding and decoding based on syndrome accumulation over a binary regular LDPC Enseme
inferred← citeshttps://doi.org/10.1109/isit.2003.1228066openalex-snapshot
Sequential MPM coding
inferred← citeshttps://doi.org/10.1109/isit.2005.1523766openalex-snapshot
A universal lossless compressor with side information based on context tree weighting
inferred← citeshttps://doi.org/10.1109/isit.2005.1523767openalex-snapshot
Bayes universal coding algorithm for side information context tree models
inferred← citeshttps://doi.org/10.1109/isit.2007.4557263openalex-snapshot
Universal Data Compression with Side Information at the Decoder by Using Traditional Universal Lossless Compression Algorithms
inferred← citeshttps://doi.org/10.1109/isit.2008.4595020openalex-snapshot
On interactive encoding and decoding for lossless source coding with decoder only side information
inferred← citeshttps://doi.org/10.1109/isit.2008.4595404openalex-snapshot
Framework and algorithms for collaborative compression
inferred← citeshttps://doi.org/10.1109/isit.2010.5513275openalex-snapshot
On the error exponent to redundancy ratio of interactive encoding and decoding
inferred← citeshttps://doi.org/10.1109/isit.2017.8006539openalex-snapshot
On optimality and redundancy of side information version of SWLZ
inferred← citeshttps://doi.org/10.1109/isit.2017.8006992openalex-snapshot
Fixed-length-parsing universal compression with side information
inferred← citeshttps://doi.org/10.1109/isita.2008.4895573openalex-snapshot
On the optimality of Sliding Window Lempel-Ziv algorithm with side information
inferred← citeshttps://doi.org/10.1109/itcc.2005.24openalex-snapshot
A parallel scheme for implementing multialphabet arithmetic coding in high-speed programmable hardware
inferred← citeshttps://doi.org/10.1109/mbits.2022.3210891openalex-snapshot
Survey of Grammar-Based Data Structure Compression
inferred← citeshttps://doi.org/10.1109/tcsi.2007.902527openalex-snapshot
An FPGA-Based Implementation of Multi-Alphabet Arithmetic Coding
inferred← citeshttps://doi.org/10.1109/tit.2004.830758openalex-snapshot
Grammar-Based Lossless Universal Refinement Source Coding
inferred← citeshttps://doi.org/10.1109/tit.2006.880020openalex-snapshot
An Algorithm for Universal Lossless Compression With Side Information
inferred← citeshttps://doi.org/10.1109/tit.2010.2040867openalex-snapshot
Interactive Encoding and Decoding for One Way Learning: Near Lossless Recovery With Side Information at the Decoder
inferred← citeshttps://doi.org/10.1109/tit.2011.2158899openalex-snapshot
Linear Interactive Encoding and Decoding for Lossless Source Coding With Decoder Only Side Information
inferred← citeshttps://doi.org/10.1109/tit.2012.2236604openalex-snapshot
Interactive Encoding and Decoding Based on Binary LDPC Codes With Syndrome Accumulation
inferred← citeshttps://doi.org/10.1109/tit.2015.2424406openalex-snapshot
An Information-Spectrum Approach to Weak Variable-Length Source Coding With Side-Information
inferred← citeshttps://doi.org/10.1109/tit.2021.3062614openalex-snapshot
Fundamental Limits of Lossless Data Compression With Side Information
inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot
Pattern Matching in Compressed Texts and Images
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.2083openalex-snapshot
On the Overflow Probability of Fixed-to-Variable Length Codes with Side Information
inferred← citeshttps://doi.org/10.17863/cam.54413openalex-snapshot
Sharp Second-Order Pointwise Asymptotics for Lossless Compression with Side Information.
inferred← citeshttps://doi.org/10.26421/qic3.4-5openalex-snapshot
Universal compression of ergodic quantum sources
inferred← citeshttps://doi.org/10.3233/fi-2013-864openalex-snapshot
Discrete Tomography Data Footprint Reduction via Natural Compression
inferred← citeshttps://doi.org/10.3390/e22060705openalex-snapshot
Sharp Second-Order Pointwise Asymptotics for Lossless Compression with Side Information
inferred← citeshttps://doi.org/10.3390/e25010048openalex-snapshot
Why Shape Coding? Asymptotic Analysis of the Entropy Rate for Digital Images
inferred← citeshttps://doi.org/10.48550/arxiv.1201.5167openalex-snapshot
Interactive Encoding and Decoding Based on Binary LDPC Codes with Syndrome Accumulation
inferred← citeshttps://doi.org/10.9708/jksci.2014.19.2.133openalex-snapshot
Compression of Medical Examination Data Based on Modified Gamma-Coding
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.