On the public citation graph
An Algorithm for Quantization of Discrete Probability Distributions
0 signed · 52 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/j.1538-7305.1959.tb01583.xopenalex-snapshot
Variable-Length Binary Encodings
inferredcites →https://doi.org/10.1007/978-1-4757-6568-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1007/bfb0103945openalex-snapshot
Foundations of Quantization for Probability Distributions
inferredcites →https://doi.org/10.1016/0016-0032(64)90319-9openalex-snapshot
Information and information stability of random variables and processes
inferredcites →https://doi.org/10.1016/j.cviu.2007.09.014openalex-snapshot
Speeded-Up Robust Features (SURF)
inferredcites →https://doi.org/10.1016/j.ipl.2005.10.006openalex-snapshot
Compressing probability distributions
inferredcites →https://doi.org/10.1023/b:visi.0000029664.99615.94openalex-snapshot
Distinctive Image Features from Scale-Invariant Keypoints
inferredcites →https://doi.org/10.1038/125266a0openalex-snapshot
An Introduction to the Geometry of N Dimensions
inferredcites →https://doi.org/10.1090/mmono/203openalex-snapshot
Mathematics of Information and Coding
inferredcites →https://doi.org/10.1109/18.481776openalex-snapshot
Fisher information and stochastic complexity
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.720546openalex-snapshot
The method of types [information theory]
inferredcites →https://doi.org/10.1109/cvpr.2009.5206733openalex-snapshot
CHoG: Compressed histogram of gradients A low bit-rate feature descriptor
inferredcites →https://doi.org/10.1109/cvprw.2010.5543242openalex-snapshot
Quantization schemes for low bitrate Compressed Histogram of Gradients descriptors
inferredcites →https://doi.org/10.1109/proc.1966.5167openalex-snapshot
Sequence time coding for data compression
inferredcites →https://doi.org/10.1109/proc.1966.5344openalex-snapshot
Comments on "Sequence time coading for data compression"
inferredcites →https://doi.org/10.1109/tcom.1971.1090789openalex-snapshot
Adaptive Variable-Length Coding for Efficient Compression of Spacecraft Television Data
inferredcites →https://doi.org/10.1109/tcomm.1994.577050openalex-snapshot
Universal source coding with codebook transmission
inferredcites →https://doi.org/10.1109/tit.1972.1054832openalex-snapshot
An algorithm for source coding
inferredcites →https://doi.org/10.1109/tit.1978.1055959openalex-snapshot
Variations on a theme by Huffman
inferredcites →https://doi.org/10.1109/tit.1981.1056331openalex-snapshot
The performance of universal encoding
inferredcites →https://doi.org/10.1109/tit.1984.1056936openalex-snapshot
Universal coding, information, prediction, and estimation
inferredcites →https://doi.org/10.1109/tit.2003.811927openalex-snapshot
Refinements of Pinsker's inequality
inferredcites →https://doi.org/10.1109/tpami.2005.188openalex-snapshot
A performance evaluation of local descriptors
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.2307/2985711openalex-snapshot
Information and Information Stability of Random Variables and Processes.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-54071-4_24openalex-snapshot
Reinforcement Learning for Networked Control and Optimal Quantization
inferred← citeshttps://doi.org/10.1007/978-3-319-79033-6_5openalex-snapshot
Approximations for Partially Observed Markov Decision Processes
inferred← citeshttps://doi.org/10.1016/j.image.2016.11.004openalex-snapshot
Low Bit-rate 3D feature descriptors for depth data from Kinect-style sensors
inferred← citeshttps://doi.org/10.1109/cdc49753.2023.10383642openalex-snapshot
Reinforcement Learning for Zero-Delay Coding Over a Noisy Channel with Feedback
inferred← citeshttps://doi.org/10.1109/icc51166.2024.10622771openalex-snapshot
Communicating Classification Results Over Noisy Channels
inferred← citeshttps://doi.org/10.1109/ieeeconf67917.2025.11443919openalex-snapshot
Joint control and communication scheduling in multi-agent systems with two receivers
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518171openalex-snapshot
Nested LDPC Codes for Random Access Communication
inferred← citeshttps://doi.org/10.1109/itw.2012.6404756openalex-snapshot
Compressing multisets using tries
inferred← citeshttps://doi.org/10.1109/jsait.2025.3595005openalex-snapshot
Input Optimization in the Composite DNA Storage Channel
inferred← citeshttps://doi.org/10.1109/lcomm.2026.3651580openalex-snapshot
Quantize-Sample-and-Verify: LLM Acceleration via Adaptive Edge-Cloud Speculative Decoding
inferred← citeshttps://doi.org/10.1109/ssp.2011.5967633openalex-snapshot
Multilevel minimax hypothesis testing
inferred← citeshttps://doi.org/10.1109/tac.2019.2907172openalex-snapshot
Asymptotic Optimality of Finite Model Approximations for Partially Observed Markov Decision Processes With Discounted Cost
inferred← citeshttps://doi.org/10.1109/tcomm.2024.3484939openalex-snapshot
Latency-Distortion Tradeoffs in Communicating Classification Results Over Noisy Channels
inferred← citeshttps://doi.org/10.1109/tit.2014.2346194openalex-snapshot
Optimal Grouping for Group Minimax Hypothesis Testing
inferred← citeshttps://doi.org/10.1109/tit.2016.2610433openalex-snapshot
Optimal Quantization for Distribution Synthesis
inferred← citeshttps://doi.org/10.1109/tit.2024.3416063openalex-snapshot
Reinforcement Learning for Near-Optimal Design of Zero-Delay Codes for Markov Sources
inferred← citeshttps://doi.org/10.1109/tit.2026.3681183openalex-snapshot
Sliding Finite Window Codes: Near-Optimality and Q-Learning for Zero-Delay Coding
inferred← citeshttps://doi.org/10.23919/acc53348.2022.9867605openalex-snapshot
Decentralized Control of Two Agents with Nested Accessible Information
inferred← citeshttps://doi.org/10.32657/10356/72484openalex-snapshot
Salient keypoint detectors and compact feature descriptors for 3D perception
inferred← citeshttps://doi.org/10.3390/e18070262openalex-snapshot
Greedy Algorithms for Optimal Distribution Approximation
inferred← citeshttps://doi.org/10.48550/arxiv.1710.07009openalex-snapshot
Finite Model Approximations for Partially Observed Markov Decision Processes with Discounted Cost
inferred← citeshttps://doi.org/10.48550/arxiv.2010.08843openalex-snapshot
Approximate information state for approximate planning and reinforcement learning in partially observed systems
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.