On the public citation graph
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
0 signed · 23 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/bf01840359openalex-snapshot
Geometric applications of a matrix-searching algorithm
inferredcites →https://doi.org/10.1016/0920-5489(93)90038-sopenalex-snapshot
JPEG: Still image data compression standard
inferredcites →https://doi.org/10.1109/dcc.2003.1194028openalex-snapshot
Optimal alphabet partitioning for semi-adaptive coding of sources of unknown sparse distributions
inferredcites →https://doi.org/10.1109/tcsvt.2004.835150openalex-snapshot
Efficient, Low-Complexity Image Coding With a Set-Partitioning Embedded Block Coder
inferredcites →https://doi.org/10.1117/1.482669openalex-snapshot
Book Review: Digital Video: An Introduction to MPEG-2
inferredcites →https://doi.org/10.1117/12.263240openalex-snapshot
Low-complexity waveform coding via alphabet and sample-set partitioning
inferredcites →https://doi.org/10.1117/12.365841openalex-snapshot
Lapped orthogonal transform coding by amplitude and group partitioning
inferredcites →https://doi.org/10.1145/800141.804691openalex-snapshot
Efficient dynamic programming using quadrangle inequalities
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-030-32686-9_32openalex-snapshot
A Practical Alphabet-Partitioning Rank/Select Data Structure
inferred← citeshttps://doi.org/10.1007/s00453-012-9726-3openalex-snapshot
Efficient Fully-Compressed Sequence Representations
inferred← citeshttps://doi.org/10.1093/comjnl/bxaf102openalex-snapshot
Engineering rank/select data structures for large-alphabet strings
inferred← citeshttps://doi.org/10.1109/icip.2008.4712401openalex-snapshot
Exploiting patterns of data magnitude for efficient image coding
inferred← citeshttps://doi.org/10.1109/isit.2006.262028openalex-snapshot
Worst-case Analysis of the Low-complexity Symbol Grouping Coding Technique
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654039openalex-snapshot
Constrained Maximum Entropy Contiguous Aggregations
inferred← citeshttps://doi.org/10.1109/ism59092.2023.00007openalex-snapshot
Bitstream Organization for Parallel Entropy Coding on Neural Network-based Video Codecs
inferred← citeshttps://doi.org/10.1109/lcomm.2026.3721974openalex-snapshot
Polyphase Parallel Source Layer Architecture for Low Rate Encoding
inferred← citeshttps://doi.org/10.1145/1644015.1644032openalex-snapshot
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
inferred← citeshttps://doi.org/10.48550/arxiv.0911.4981openalex-snapshot
Efficient Fully-Compressed Sequence Representations
inferred← citeshttps://doi.org/10.5555/1109557.1109562openalex-snapshot
The Knuth-Yao quadrangle-inequality speedup is a consequence of total-monotonicity
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.