On the public citation graph

Toward a Source Coding Theory for Sets

0 signed · 42 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/0471722162openalex-snapshot
Order Statistics
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1007/978-1-4419-8608-5openalex-snapshot
A First Course in Information Theory
inferredcites →https://doi.org/10.1007/978-3-7091-2928-9_2openalex-snapshot
Universal Source Coding
inferredcites →https://doi.org/10.1007/bf00532806openalex-snapshot
Some characterizations of almost sure bounds for weighted multidimensional empirical distributions and a Glivenko-Cantelli theorem for sample quantiles
inferredcites →https://doi.org/10.1109/18.42217openalex-snapshot
High-resolution quantization theory and the vector quantizer advantage
inferredcites →https://doi.org/10.1109/18.52473openalex-snapshot
The entropy of ordered sequences and order statistics
inferredcites →https://doi.org/10.1109/18.720546openalex-snapshot
The method of types [information theory]
inferredcites →https://doi.org/10.1109/18.761251openalex-snapshot
Entropy computations via analytic depoissonization
inferredcites →https://doi.org/10.1109/18.959273openalex-snapshot
On optimal permutation codes
inferredcites →https://doi.org/10.1109/78.622940openalex-snapshot
Optimum quantization of order statistics
inferredcites →https://doi.org/10.1109/tit.1964.1053705openalex-snapshot
Information rates of non-Gaussian processes
inferredcites →https://doi.org/10.1109/tit.1973.1055092openalex-snapshot
Universal noiseless coding
inferredcites →https://doi.org/10.1137/1103008openalex-snapshot
$\varepsilon $-Entropy of a Discrete Random Variable
inferredcites →https://doi.org/10.1145/950620.950622openalex-snapshot
Improving table compression with combinatorial optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s11760-025-04049-zopenalex-snapshot
Distributed coding with sorting and assignment
inferred← citeshttps://doi.org/10.1038/s41467-017-02480-6openalex-snapshot
Optimal compressed representation of high throughput sequence data via light assembly
inferred← citeshttps://doi.org/10.1109/acssc.2006.354915openalex-snapshot
Partial-Order Bit-Allocation Schemes for Lowrate Quantization
inferred← citeshttps://doi.org/10.1109/ciss.2016.7460471openalex-snapshot
Fidelity loss in distribution-preserving anonymization and histogram equalization
inferred← citeshttps://doi.org/10.1109/dcc.2011.12openalex-snapshot
Coding of Sets of Words
inferred← citeshttps://doi.org/10.1109/dcc.2013.83openalex-snapshot
Considerations and Algorithms for Compression of Sets
inferred← citeshttps://doi.org/10.1109/dcc.2014.89openalex-snapshot
Compressing Sets and Multisets of Sequences
inferred← citeshttps://doi.org/10.1109/dcc.2016.77openalex-snapshot
Compressing Combinatorial Objects
inferred← citeshttps://doi.org/10.1109/dcc.2017.60openalex-snapshot
Universal Source Coding of Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/dcc50243.2021.00061openalex-snapshot
The Twelvefold Way of Non-Sequential Lossless Compression
inferred← citeshttps://doi.org/10.1109/dcc52660.2022.00040openalex-snapshot
Compressing Multisets with Large Alphabets
inferred← citeshttps://doi.org/10.1109/ic2e.2014.73openalex-snapshot
An Information-Theoretic View of Cloud Workloads
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413447openalex-snapshot
Predictive Coding for Lossless Dataset Compression
inferred← citeshttps://doi.org/10.1109/isit-w61686.2024.10591764openalex-snapshot
Semantic Compression with Information Lattice Learning
inferred← citeshttps://doi.org/10.1109/isit.2011.6033752openalex-snapshot
Codes for unordered sets of words
inferred← citeshttps://doi.org/10.1109/ita.2007.4357578openalex-snapshot
On Universal Coding of Unordered Data
inferred← citeshttps://doi.org/10.1109/itw.2012.6404756openalex-snapshot
Compressing multisets using tries
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611421openalex-snapshot
Multiple-Output Channel Simulation and Lossy Compression of Probability Distributions
inferred← citeshttps://doi.org/10.1109/jsait.2023.3245417openalex-snapshot
Compressing Multisets With Large Alphabets
inferred← citeshttps://doi.org/10.1109/jsait.2023.3261819openalex-snapshot
Universal and Succinct Source Coding of Deep Neural Networks
inferred← citeshttps://doi.org/10.1109/jstqe.2023.3333834openalex-snapshot
The Role of Detection Times in Reflectivity Estimation With Single-Photon Lidar
inferred← citeshttps://doi.org/10.1109/spcom.2016.7746651openalex-snapshot
Text compression using lexicographic permutation of binary strings
inferred← citeshttps://doi.org/10.1109/synasc.2008.89openalex-snapshot
Data Compression on Multisets. Submultiset-Free Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2789292openalex-snapshot
Codes in the Space of Multisets—Coding for Permutation Channels With Impairments
inferred← citeshttps://doi.org/10.1145/3711896.3737034openalex-snapshot
Lossless Set Compression by Binary Tree Coding
inferred← citeshttps://doi.org/10.48550/arxiv.0708.2310openalex-snapshot
Benefiting from Disorder: Source Coding for Unordered Data
inferred← citeshttps://doi.org/10.48550/arxiv.1207.6986openalex-snapshot
Two Embedding Theorems for Data with Equivalences under Finite Group Action
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.