On the public citation graph

High-order entropy coding for images

0 signed · 20 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.1109/jsac.1987.1146627openalex-snapshot
Entropy Coding for Low-Bit-Rate Visual Telecommunications
inferredcites →https://doi.org/10.1109/tcom.1981.1095052openalex-snapshot
Compression of Black-White Images with Arithmetic Coding
inferredcites →https://doi.org/10.1117/12.962306openalex-snapshot
High-Speed Programmable Ics For Decoding Of Variable-Length Codes
inferredcites →https://doi.org/10.1117/12.976200openalex-snapshot
Low-Rate Entropy Coding Of Transformed Images

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45453-5_13openalex-snapshot
On the Optimal Coding
inferred← citeshttps://doi.org/10.1016/b978-0-444-88790-0.50018-6openalex-snapshot
Parallel Processing and Pipelining in Huffmann Decoder* *This research was supported by the Army Research Office under contract number DAAL03-90-G-0063.
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00002-2openalex-snapshot
A memory-efficient and fast Huffman decoding algorithm
inferred← citeshttps://doi.org/10.1080/00207160410001715285openalex-snapshot
Optimal synchronous coding
inferred← citeshttps://doi.org/10.1109/26.469442openalex-snapshot
Memory efficient and high-speed search Huffman coding
inferred← citeshttps://doi.org/10.1109/30.320814openalex-snapshot
Design and hardware implementation of a memory efficient Huffman decoding
inferred← citeshttps://doi.org/10.1109/76.486417openalex-snapshot
Binary decompositions for high-order entropy coding of grayscale images
inferred← citeshttps://doi.org/10.1109/83.541428openalex-snapshot
Lossless compression of VQ index with search-order coding
inferred← citeshttps://doi.org/10.1109/83.541429openalex-snapshot
Anisotropic diffusion of multivalued images with applications to color filtering
inferred← citeshttps://doi.org/10.1109/icce.1994.582159openalex-snapshot
Design and Hardware Construction of a High Speed and Memory Efficient Huffman Decoding
inferred← citeshttps://doi.org/10.1109/icip.2000.901116openalex-snapshot
Conditional DCT event coding without side information in video compression
inferred← citeshttps://doi.org/10.1109/itcc.2002.1000421openalex-snapshot
On synchronous coding
inferred← citeshttps://doi.org/10.1109/mwscas.2001.986139openalex-snapshot
Efficient resource allocation and higher speed for image decoders
inferred← citeshttps://doi.org/10.1109/pacrim.2001.953552openalex-snapshot
Reduced code transmission and high speed reconstruction of Huffman tables
inferred← citeshttps://doi.org/10.1142/s0219427902000753openalex-snapshot
Improving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding
inferred← citeshttps://doi.org/10.3233/fun-2005-65404openalex-snapshot
Data Compressor for VQ Index Tables
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.