On the public citation graph
Variable-rate trellis source encoding
0 signed · 90 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.1002/9780470316962openalex-snapshot
Convergence of Probability Measures
inferredcites →https://doi.org/10.1007/978-1-4615-3626-0openalex-snapshot
Vector Quantization and Signal Compression
inferredcites →https://doi.org/10.1007/978-1-4757-2024-2openalex-snapshot
Probability, Random Processes, and Ergodic Properties
inferredcites →https://doi.org/10.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1109/18.119697openalex-snapshot
Entropy-constrained trellis-coded quantization
inferredcites →https://doi.org/10.1109/18.119698openalex-snapshot
On the rate-distortion efficiency of subband coding
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.21250openalex-snapshot
Trellis source code design as an optimization problem
inferredcites →https://doi.org/10.1109/18.340466openalex-snapshot
Variable-rate source coding theorems for stationary nonergodic sources
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.508836openalex-snapshot
A vector quantization approach to universal noiseless coding and quantization
inferredcites →https://doi.org/10.1109/18.567651openalex-snapshot
The redundancy of source coding with a fidelity criterion. 1. Known statistics
inferredcites →https://doi.org/10.1109/18.623145openalex-snapshot
Fixed-slope universal lossy data compression
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/26.2723openalex-snapshot
Trellis source codes designed by conjugate gradient optimization
inferredcites →https://doi.org/10.1109/26.46532openalex-snapshot
Trellis coded quantization of memoryless and Gauss-Markov sources
inferredcites →https://doi.org/10.1109/29.17498openalex-snapshot
Entropy-constrained vector quantization
inferredcites →https://doi.org/10.1109/icassp.1990.115572openalex-snapshot
Conditional entropy-constrained vector quantization of linear predictive coefficients
inferredcites →https://doi.org/10.1109/isit.1994.394769openalex-snapshot
Distortion-complexity and rate-distortion function
inferredcites →https://doi.org/10.1109/isit.1995.531181openalex-snapshot
Fixed-slope universal algorithms for lossy source coding via lossless codeword length functions
inferredcites →https://doi.org/10.1109/tcom.1972.1091311openalex-snapshot
Rate Distortion Theory: A Mathematical Basis for Data Compression
inferredcites →https://doi.org/10.1109/tcom.1982.1095515openalex-snapshot
The Design of Trellis Waveform Coders
inferredcites →https://doi.org/10.1109/tcom.1984.1096023openalex-snapshot
Sequential Coding Algorithms: A Survey and Cost Analysis
inferredcites →https://doi.org/10.1109/tcom.1986.1096455openalex-snapshot
The Design of Predictive Trellis Waveform Coders Using the Generalized Lloyd Algorithm
inferredcites →https://doi.org/10.1109/tit.1967.1054003openalex-snapshot
Analog source digitization: A comparison of theory and practice (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1968.1054193openalex-snapshot
Asymptotically efficient quantizing
inferredcites →https://doi.org/10.1109/tit.1969.1054355openalex-snapshot
Tree encoding of memoryless time-discrete sources with a fidelity criterion
inferredcites →https://doi.org/10.1109/tit.1972.1054753openalex-snapshot
An algorithm for computing the capacity of arbitrary discrete memoryless channels
inferredcites →https://doi.org/10.1109/tit.1972.1054855openalex-snapshot
Computation of channel capacity and rate-distortion functions
inferredcites →https://doi.org/10.1109/tit.1974.1055166openalex-snapshot
Tree encoding for symmetric sources with a distortion measure
inferredcites →https://doi.org/10.1109/tit.1974.1055233openalex-snapshot
Trellis Encoding of memoryless discrete-time sources with a fidelity criterion
inferredcites →https://doi.org/10.1109/tit.1974.1055234openalex-snapshot
Tree encoding of Gaussian sources
inferredcites →https://doi.org/10.1109/tit.1974.1055287openalex-snapshot
The ergodic decomposition of stationary discrete random processes
inferredcites →https://doi.org/10.1109/tit.1977.1055657openalex-snapshot
Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterion
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.1979.1056067openalex-snapshot
Asymptotically optimal block quantization
inferredcites →https://doi.org/10.1109/tit.1980.1056164openalex-snapshot
Distortion-rate theory for individual sequences
inferredcites →https://doi.org/10.1109/tit.1980.1056165openalex-snapshot
Optimal encoding of discrete-time continuous-amplitude memoryless sources with finite output alphabets
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.1982.1056456openalex-snapshot
Minimum entropy quantizers and permutation codes
inferredcites →https://doi.org/10.1109/tit.1982.1056487openalex-snapshot
Stochastic stability for feedback quantization schemes
inferredcites →https://doi.org/10.1109/tit.1982.1056489openalex-snapshot
Least squares quantization in PCM
inferredcites →https://doi.org/10.1109/tit.1982.1056490openalex-snapshot
Asymptotic quantization error of continuous signals and the quantization dimension
inferredcites →https://doi.org/10.1109/tit.1982.1056491openalex-snapshot
On optimal finite-state digital transmission systems
inferredcites →https://doi.org/10.1109/tit.1984.1056920openalex-snapshot
Optimum quantizer performance for a class of non-Gaussian memoryless sources
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.1057377openalex-snapshot
A list-type reduced-constraint generalization of the Viterbi algorithm
inferredcites →https://doi.org/10.1147/rd.203.0198openalex-snapshot
Generalized Kraft Inequality and Arithmetic Coding
inferredcites →https://doi.org/10.1214/aop/1176996354openalex-snapshot
Nonblock Source Coding with a Fidelity Criterion
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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.1109/acssc.2011.6189995openalex-snapshot
Dithered soft decision quantization for baseline JPEG encoding and its joint optimization with huffman coding and quantization table selection
inferred← citeshttps://doi.org/10.1109/allerton.2011.6120380openalex-snapshot
Lossy Lempel-Ziv like compression algorithms for memoryless sources
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/cwit.2011.5872123openalex-snapshot
On optimum fixed-rate causal scalar quantization design for causal video coding
inferred← citeshttps://doi.org/10.1109/dcc.2003.1194013openalex-snapshot
Codelet parsing: quadratic-time, sequential, adaptive algorithms for lossy compression
inferred← citeshttps://doi.org/10.1109/dcc.2005.81openalex-snapshot
Short-Block Variable-Rate Trellis Quantization
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/icip.2013.6738382openalex-snapshot
Quantization table design revisited for image/video coding
inferred← citeshttps://doi.org/10.1109/isit.1998.708974openalex-snapshot
Variable rate trellis source encoding
inferred← citeshttps://doi.org/10.1109/isit.2003.1228182openalex-snapshot
On the redundancy of universal trellis lossy source coding
inferred← citeshttps://doi.org/10.1109/isit.2005.1523680openalex-snapshot
On the error exponent of trellis source coding
inferred← citeshttps://doi.org/10.1109/isit.2010.5513274openalex-snapshot
Local coordinates of a trellis source code
inferred← citeshttps://doi.org/10.1109/jsait.2024.3422011openalex-snapshot
JPEG Compliant Compression for DNN Vision
inferred← citeshttps://doi.org/10.1109/pcs.2010.5702588openalex-snapshot
An improved iterative algorithm for calculating the ratedistortion performance of causal video coding for continuous sources and its application to real video data
inferred← citeshttps://doi.org/10.1109/tcomm.2007.904375openalex-snapshot
Linear Congruential Trellis Source Codes: Design and Analysis
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.2007.901246openalex-snapshot
Reduced-Complexity Delayed-Decision Algorithm for Context-Based Image Processing Systems
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/tip.2014.2383324openalex-snapshot
An Efficient DCT-Based Image Compression System Based on Laplacian Transparent Composite Model
inferred← citeshttps://doi.org/10.1109/tip.2017.2703112openalex-snapshot
Hybrid Laplace Distribution-Based Low Complexity Rate-Distortion Optimized Quantization
inferred← citeshttps://doi.org/10.1109/tit.2005.856953openalex-snapshot
On the Error Exponent of Trellis Source Coding
inferred← citeshttps://doi.org/10.1109/tit.2011.2145930openalex-snapshot
Rate-Constrained Simulation and Source Coding i.i.d. Sources
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/tsp.2004.839911openalex-snapshot
Joint watermarking and compression using scalar quantization for maximizing robustness in the presence of additive Gaussian attacks
inferred← citeshttps://doi.org/10.1109/tsp.2012.2206585openalex-snapshot
An MCMC Approach to Universal Lossy Compression of Analog Sources
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.