An Upper Limit of AC Huffman Code Length in JPEG Compression

01/19/2009
by   Kenichi Horie, et al.
0

A strategy for computing upper code-length limits of AC Huffman codes for an 8x8 block in JPEG Baseline coding is developed. The method is based on a geometric interpretation of the DCT, and the calculated limits are as close as 14 transform coding methods, e.g., MPEG 2 and 4 video compressions, to calculate close upper code length limits for the respective processing blocks.

READ FULL TEXT
research
06/18/2020

No projective 16-divisible binary linear code of length 131 exists

We show that no projective 16-divisible binary linear code of length 131...
research
03/29/2022

Equivalences among Z_p^s-linear Generalized Hadamard Codes

The _p^s-additive codes of length n are subgroups of _p^s^n, and can be ...
research
01/31/2022

Non-adaptive and two-stage coding over the Z-channel

In this paper, we developed new coding strategies for the Z-channel. In ...
research
09/15/2019

Run-Length Encoding in a Finite Universe

Text compression schemes and compact data structures usually combine sop...
research
01/15/2018

A Finite Block Length Achievability Bound for Low Probability of Detection Communication

Low probability of detection (or covert) communication refers to the sce...
research
09/27/2022

Local Grammar-Based Coding Revisited

We revisit the problem of minimal local grammar-based coding. In this se...
research
06/16/2016

3D zigzag for multislicing, multiband and video processing

We present a 3D zigzag rafter (first in literature) which allows us to o...

Please sign up or login with your details

Forgot password? Click here to reset