On the public citation graph

Large-Alphabet Semi-Static Entropy Coding Via Asymmetric Numeral Systems

0 signed · 56 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/spe.2203openalex-snapshot
Decoding billions of integers per second through vectorization
inferredcites →https://doi.org/10.1002/spe.4380250804openalex-snapshot
Adding compression to a full‐text retrieval system
inferredcites →https://doi.org/10.1007/978-1-4615-0935-6openalex-snapshot
Compression and Coding Algorithms
inferredcites →https://doi.org/10.1007/978-3-540-39984-1_10openalex-snapshot
(S,C)-Dense Coding: An Optimized Compression Code for Natural Language Text Databases
inferredcites →https://doi.org/10.1007/978-3-642-82456-2openalex-snapshot
Combinatorial Algorithms on Words
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_12openalex-snapshot
Novel Compression of Sparse Bit-Strings — Preliminary Report
inferredcites →https://doi.org/10.1007/bf02243872openalex-snapshot
Is Huffman coding dead?
inferredcites →https://doi.org/10.1007/s11265-018-1421-4openalex-snapshot
An Architecture for Asymmetric Numeral Systems Entropy Decoder - A Comparison with a Canonical Huffman Decoder
inferredcites →https://doi.org/10.1016/0306-4573(92)90066-9openalex-snapshot
Analysis of arithmetic coding for data compression
inferredcites →https://doi.org/10.1016/0306-4573(92)90067-aopenalex-snapshot
New methods for lossless image compression using arithmetic coding
inferredcites →https://doi.org/10.1023/a:1013002601898openalex-snapshot
Binary Interpolative Coding for Effective Index Compression
inferredcites →https://doi.org/10.1023/a:1022949613039openalex-snapshot
Compressing Inverted Files
inferredcites →https://doi.org/10.1093/comjnl/30.6.541openalex-snapshot
Data Compression Using Dynamic Markov Modelling
inferredcites →https://doi.org/10.1093/comjnl/40.2_and_3.76openalex-snapshot
Semantically Motivated Improvements for PPM Variants
inferredcites →https://doi.org/10.1093/comjnl/42.3.193openalex-snapshot
Compressing Integers for Fast File Access
inferredcites →https://doi.org/10.1093/comjnl/bxn030openalex-snapshot
Tournament Coding of Integer Sequences
inferredcites →https://doi.org/10.1109/26.843129openalex-snapshot
Housekeeping for prefix coding
inferredcites →https://doi.org/10.1109/5.286189openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1109/dcc.1994.305899openalex-snapshot
Proceedings of IEEE Data Compression Conference (DCC'94)
inferredcites →https://doi.org/10.1109/dcc.1998.672314openalex-snapshot
A fast renormalisation for arithmetic coding
inferredcites →https://doi.org/10.1109/dcc.2017.74openalex-snapshot
Marlin: A High Throughput Variable-to-Fixed Codec Using Plurally Parsable Dictionaries
inferredcites →https://doi.org/10.1109/icde.2006.150openalex-snapshot
Super-Scalar RAM-CPU Cache Compression
inferredcites →https://doi.org/10.1109/isit.2019.8849430openalex-snapshot
Fast Construction of Almost Optimal Symbol Distributions for Asymmetric Numeral Systems
inferredcites →https://doi.org/10.1109/isit9354.2005openalex-snapshot
Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.
inferredcites →https://doi.org/10.1109/jrproc.1952.273898openalex-snapshot
A Method for the Construction of Minimum-Redundancy Codes
inferredcites →https://doi.org/10.1109/proc.1973.9200openalex-snapshot
A Huffman-Shannon-Fano code
inferredcites →https://doi.org/10.1109/tcom.1984.1096090openalex-snapshot
Data Compression Using Adaptive Coding and Partial String Matching
inferredcites →https://doi.org/10.1109/tit.1966.1053907openalex-snapshot
Run-length encodings (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1975.1055349openalex-snapshot
Universal codeword sets and representations of the integers
inferredcites →https://doi.org/10.1109/tit.2015.2452252openalex-snapshot
Efficient and Compact Representations of Prefix Codes
inferredcites →https://doi.org/10.1145/1390334.1390360openalex-snapshot
Reorganizing compressed text
inferredcites →https://doi.org/10.1145/1526709.1526764openalex-snapshot
Inverted index compression and query processing with optimized document ordering
inferredcites →https://doi.org/10.1145/2009916.2010087openalex-snapshot
Sample selection for dictionary-based corpus compression
inferredcites →https://doi.org/10.1145/214762.214771openalex-snapshot
Arithmetic coding for data compression
inferredcites →https://doi.org/10.1145/290159.290162openalex-snapshot
Arithmetic coding revisited
inferredcites →https://doi.org/10.1145/3132847.3132888openalex-snapshot
ANS-Based Index Compression
inferredcites →https://doi.org/10.1145/3231935openalex-snapshot
Brotli
inferredcites →https://doi.org/10.1145/3289600.3290962openalex-snapshot
Fast Dictionary-Based Compression for Inverted Indexes
inferredcites →https://doi.org/10.1145/3342555openalex-snapshot
Huffman Coding
inferredcites →https://doi.org/10.1145/348751.348754openalex-snapshot
Fast and flexible word searching on compressed text
inferredcites →https://doi.org/10.1145/45072.45074openalex-snapshot
Data compression
inferredcites →https://doi.org/10.1145/76894.76896openalex-snapshot
Modeling for text compression
inferredcites →https://doi.org/10.14778/2078331.2078341openalex-snapshot
Relative Lempel-Ziv factorization for efficient storage and retrieval of web collections
inferredcites →https://doi.org/10.48550/arxiv.0902.0271openalex-snapshot
Asymmetric numeral systems
inferredcites →https://doi.org/10.48550/arxiv.1311.2540openalex-snapshot
Asymmetric numeral systems: entropy coding combining speed of Huffman coding with compression rate of arithmetic coding
inferredcites →https://doi.org/10.48550/arxiv.1402.3392openalex-snapshot
Interleaved entropy coders

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10207-022-00597-4openalex-snapshot
ANS-based compression and encryption with 128-bit security
inferred← citeshttps://doi.org/10.1016/j.heliyon.2023.e17602openalex-snapshot
An efficient and secure compression technique for data protection using burrows-wheeler transform algorithm
inferred← citeshttps://doi.org/10.1109/access.2024.3406912openalex-snapshot
On Nonlinear Compression Costs: When Shannon Meets Rényi
inferred← citeshttps://doi.org/10.1109/access.2025.3555119openalex-snapshot
Toward Greener Matrix Operations by Lossless Compressed Formats
inferred← citeshttps://doi.org/10.1109/icccworkshops57813.2023.10233773openalex-snapshot
A Novel ANS Coding with Low Computational Complexity
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619702openalex-snapshot
An Asymmetric Encoding - Decoding Scheme for Lossless Data Compression
inferred← citeshttps://doi.org/10.1109/tifs.2021.3096026openalex-snapshot
Compcrypt–Lightweight ANS-Based Compression and Encryption
inferred← citeshttps://doi.org/10.1109/tmm.2020.3040547openalex-snapshot
Redundancy and Optimization of tANS Entropy Encoders
inferred← citeshttps://doi.org/10.14778/3547305.3547321openalex-snapshot
Improving matrix-vector multiplication via lossless grammar-compressed matrices
inferred← citeshttps://doi.org/10.3390/e24030375openalex-snapshot
A Review of the Asymmetric Numeral System and Its Applications to Digital Images
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.