On the public citation graph
Fixed-slope universal lossy data compression
0 signed · 87 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.1007/978-1-4419-7970-4openalex-snapshot
Entropy and Information Theory
inferredcites →https://doi.org/10.1007/978-1-4757-3982-4openalex-snapshot
Entropy and Information Theory
inferredcites →https://doi.org/10.1007/bf02763171openalex-snapshot
The Shannon-McMillan-Breiman theorem for a class of amenable groups
inferredcites →https://doi.org/10.1070/rm1970v025n06abeh001269openalex-snapshot
THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
inferredcites →https://doi.org/10.1109/18.179376openalex-snapshot
Distortion program-size complexity with respect to a fidelity criterion and rate-distortion function
inferredcites →https://doi.org/10.1109/18.256495openalex-snapshot
An algorithm for source coding subject to a fidelity criterion, based on string matching
inferredcites →https://doi.org/10.1109/18.259634openalex-snapshot
A survey of the theory of source coding with a fidelity criterion
inferredcites →https://doi.org/10.1109/18.265494openalex-snapshot
On asymptotic optimality of a sliding window variation of Lempel-Ziv codes
inferredcites →https://doi.org/10.1109/18.481794openalex-snapshot
Simple universal lossy data compression schemes derived from the Lempel-Ziv algorithm
inferredcites →https://doi.org/10.1109/18.490546openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement. I. Basic results
inferredcites →https://doi.org/10.1109/18.490547openalex-snapshot
An on-line universal lossy data compression algorithm via continuous codebook refinement. II. Optimality for phi-mixing source models
inferredcites →https://doi.org/10.1109/18.650987openalex-snapshot
On the performance of data compression algorithms based upon string matching
inferredcites →https://doi.org/10.1109/18.75240openalex-snapshot
Strong converses in source coding relative to a fidelity criterion
inferredcites →https://doi.org/10.1109/18.75241openalex-snapshot
Sample converses in source coding theory
inferredcites →https://doi.org/10.1109/isit.1994.394769openalex-snapshot
Distortion-complexity and rate-distortion function
inferredcites →https://doi.org/10.1109/isit.1994.395002openalex-snapshot
An on-line universal lossy data compression algorithm by continuous codebook refinement
inferredcites →https://doi.org/10.1109/tit.1977.1055714openalex-snapshot
A universal algorithm for sequential data compression
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.1980.1056164openalex-snapshot
Distortion-rate theory for individual sequences
inferredcites →https://doi.org/10.1109/tit.1980.1056259openalex-snapshot
Extension of source coding theorems for block codes to sliding-block codes
inferredcites →https://doi.org/10.1109/tit.1986.1057210openalex-snapshot
Complexity of strings in the class of Markov sources
inferredcites →https://doi.org/10.1109/tit.1987.1057287openalex-snapshot
The ergodic and entropy theorems revisited
inferredcites →https://doi.org/10.1109/tit.1987.1057377openalex-snapshot
A list-type reduced-constraint generalization of the Viterbi algorithm
inferredcites →https://doi.org/10.1214/aop/1176990840openalex-snapshot
Universal Almost Sure Data Compression
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.physa.2006.01.013openalex-snapshot
Statistical mechanical approach to lossy data compression: Theory and practice
inferred← citeshttps://doi.org/10.1016/j.rser.2017.03.124openalex-snapshot
A Review on energy management schemes in energy harvesting wireless sensor networks
inferred← citeshttps://doi.org/10.1088/0305-4470/37/6/r01openalex-snapshot
Statistical mechanics of low-density parity-check codes
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.3.836openalex-snapshot
Fixed-Slope Universal Lossy Coding for Individual Sequences and Nonstationary Sources
inferred← citeshttps://doi.org/10.1103/physreve.66.066126openalex-snapshot
Statistical mechanics of lossy data compression using a nonmonotonic perceptron
inferred← citeshttps://doi.org/10.1109/18.749005openalex-snapshot
Variable-rate trellis source encoding
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.904515openalex-snapshot
Natural type selection in adaptive lossy compression
inferred← citeshttps://doi.org/10.1109/9780470544907.ch2openalex-snapshot
Fifty Years of Shannon Theory
inferred← citeshttps://doi.org/10.1109/access.2019.2947260openalex-snapshot
Efficient Hard-Decision Quantization Using an Adaptive Deadzone Offset Model for Video Coding
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120245openalex-snapshot
Universal MAP estimation in compressed sensing
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120349openalex-snapshot
Novel algorithms for distributed sequential hypothesis testing
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919866openalex-snapshot
Learning to Compress Using Deep AutoEncoder
inferred← citeshttps://doi.org/10.1109/ccece.1998.685553openalex-snapshot
On the analysis and design of variable rate trellis source codes
inferred← citeshttps://doi.org/10.1109/ciss.2008.4558567openalex-snapshot
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
inferred← citeshttps://doi.org/10.1109/dcc.2009.72openalex-snapshot
An Implementable Scheme for Universal Lossy Compression of Discrete Markov Sources
inferred← citeshttps://doi.org/10.1109/dcc.2010.11openalex-snapshot
An MCMC Approach to Lossy Compression of Continuous Sources
inferred← citeshttps://doi.org/10.1109/glocom.2012.6503327openalex-snapshot
Spectrum sensing via universal source coding
inferred← citeshttps://doi.org/10.1109/icassp.2005.1415407openalex-snapshot
On Joint Optimization of Motion Compensation, Quantization and Baseline Entropy Coding in H.264 with Complete Decoder Compatibility
inferred← citeshttps://doi.org/10.1109/icip.1998.723550openalex-snapshot
Fixed-slope near-lossless context-based image compression
inferred← citeshttps://doi.org/10.1109/icip.2007.4379276openalex-snapshot
Joint Optimization of Run-Length Coding, Huffman Coding and Quantization Table with Complete Baseline JPEG Compatibility
inferred← citeshttps://doi.org/10.1109/icip.2014.7026135openalex-snapshot
An efficient DCT-based image compression system based on transparent composite model
inferred← citeshttps://doi.org/10.1109/isit.1998.708974openalex-snapshot
Variable rate trellis source encoding
inferred← citeshttps://doi.org/10.1109/isit.2006.261850openalex-snapshot
Rate Distortion Optimization of H.264 with Main Profile Compatibility
inferred← citeshttps://doi.org/10.1109/isit.2008.4595107openalex-snapshot
Rate-distortion via Markov chain Monte Carlo
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619241openalex-snapshot
Conditional Mutual Information Constrained Deep Learning: Framework and Preliminary Results
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619597openalex-snapshot
A Distributionally Robust Approach to Shannon Limits using the Wasserstein Distance
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195233openalex-snapshot
Coded Deep Learning: Framework and Preliminary Results
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195549openalex-snapshot
Distributionally Robust Scalar Quantization Using the Wasserstein Distance
inferred← citeshttps://doi.org/10.1109/itw2.2006.323796openalex-snapshot
Fixed-Slope Universal Lossy Coding for Individual Sequences
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240262openalex-snapshot
On Distributionally Robust Lossy Source Coding
inferred← citeshttps://doi.org/10.1109/itwnit.2009.5158577openalex-snapshot
An iterative scheme for near optimal and universal lossy compression
inferred← citeshttps://doi.org/10.1109/itwnit.2009.5158578openalex-snapshot
Efficient random codebooks and databases for lossy compression in near-linear time
inferred← citeshttps://doi.org/10.1109/izs.2008.4497281openalex-snapshot
Lossy Source Coding via Markov Chain Monte Carlo
inferred← citeshttps://doi.org/10.1109/mmsp.2005.248559openalex-snapshot
Rate-distortion Optimization for MP3 Audio Coding with Complete Decoder Compatibility
inferred← citeshttps://doi.org/10.1109/tcomm.2010.06.090203openalex-snapshot
Achieving the rate-distortion bound with low-density generator matrix codes
inferred← citeshttps://doi.org/10.1109/tcomm.2012.061412.110194openalex-snapshot
Block and Sliding-Block Lossy Compression via MCMC
inferred← citeshttps://doi.org/10.1109/tcomm.2012.071212.110167openalex-snapshot
Energy Management Policies for Energy-Neutral Source-Channel Coding
inferred← citeshttps://doi.org/10.1109/tcomm.2019.2950714openalex-snapshot
Rate Distortion via Deep Learning
inferred← citeshttps://doi.org/10.1109/tcomm.2020.3020796openalex-snapshot
Compression by and for Deep Boltzmann Machines
inferred← citeshttps://doi.org/10.1109/tcsvt.2008.2009260openalex-snapshot
Soft Decision Quantization for H.264 With Main Profile Compatibility
inferred← citeshttps://doi.org/10.1109/tcsvt.2014.2380232openalex-snapshot
Fast Soft Decision Quantization With Adaptive Preselection and Dynamic Trellis Graph
inferred← citeshttps://doi.org/10.1109/tip.2007.896685openalex-snapshot
Rate Distortion Optimization for H.264 Interframe Coding: A General Framework and Algorithms
inferred← citeshttps://doi.org/10.1109/tip.2008.2007609openalex-snapshot
Joint Optimization of Run-Length Coding, Huffman Coding, and Quantization Table With Complete Baseline JPEG Decoder Compatibility
inferred← citeshttps://doi.org/10.1109/tip.2014.2358204openalex-snapshot
Quantization Table Design Revisited for Image/Video Coding
inferred← citeshttps://doi.org/10.1109/tit.2003.819340openalex-snapshot
Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?
inferred← citeshttps://doi.org/10.1109/tit.2011.2178059openalex-snapshot
Lossy Compression of Discrete Sources via the Viterbi Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2015.2428238openalex-snapshot
Variable-Length Lossy Source Code Using a Constrained-Random-Number Generator
inferred← citeshttps://doi.org/10.1109/tit.2025.3610095openalex-snapshot
Coded Deep Learning: Framework and Algorithm
inferred← citeshttps://doi.org/10.1109/tnnls.2025.3540014openalex-snapshot
Conditional Mutual Information Constrained Deep Learning for Classification
inferred← citeshttps://doi.org/10.1109/tsp.2012.2190597openalex-snapshot
Denoising via MCMC-Based Lossy Compression
inferred← citeshttps://doi.org/10.1109/tsp.2012.2206585openalex-snapshot
An MCMC Approach to Universal Lossy Compression of Analog Sources
inferred← citeshttps://doi.org/10.1109/tsp.2015.2393845openalex-snapshot
Recovery From Linear Measurements With Complexity-Matching Universal Signal Estimation
inferred← citeshttps://doi.org/10.1134/s0032946012040072openalex-snapshot
Complexity-compression tradeoffs in lossy compression via efficient random codebooks and databases
inferred← citeshttps://doi.org/10.48550/arxiv.0904.3340openalex-snapshot
Lossy Compression in Near-Linear Time via Efficient Random Codebooks and Databases
inferred← citeshttps://doi.org/10.48550/arxiv.1308.6481openalex-snapshot
Nonparametric Decentralized Sequential Detection via Universal Source Coding
inferred← citeshttps://doi.org/10.48550/arxiv.1705.05070openalex-snapshot
Statistical Physics and Information Theory Perspectives on Linear Inverse Problems
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.