DCC 2006 - PDF Preprint Papers

DCC 2006 Data Compression Conference

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DCC-2006 Paper

click to vote

DCC
2006
IEEE

364views Computer Graphics» more DCC 2006»

Adaptive Run-Length / Golomb-Rice Encoding of Quantized Generalized Gaussian Sources with Unknown Statistics

14 years 4 months ago

Download research.microsoft.com

We present a simple and efficient entropy coder that combines run-length and Golomb-Rice encoders. The encoder automatically switches between the two modes according to simple rul...

Henrique S. Malvar

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	364	Adaptive Run-Length / Golomb-Rice Encoding of Quantized Generalized Gaussian Sources with Unknown Statistics	claim
2	217	Distributed Sampling and Compression of Scenes with Finite Rate of Innovation in Camera Sensor Networks	claim
3	178	A Fuzzy Vault Scheme	claim
4	171	Cheating in Visual Cryptography	claim
5	162	Applications of representation theory to wireless communications	claim
6	155	Fast Lossless Compression of Scientific Floating-Point Data	claim
7	154	Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity	claim
8	151	Analysis of Multiple Antenna Systems with Finite-Rate Feedback Using High Resolution Quantization Theory	claim
9	145	Classification and Constructions of Complete Caps in Binary Spaces	claim
10	142	Asymptotic Nonlinearity of Boolean Functions	claim
11	142	Compression and Machine Learning: A New Perspective on Feature Space Vectors	claim
12	142	A Fast and Low Complexity Image Codec based on Backward Coding of Wavelet Trees	claim
13	141	On Compressibility of Protein Sequences	claim
14	136	Uncoverings-by-bases for base-transitive permutation groups	claim
15	136	Optimal Index Assignment for Multiple Description Lattice Vector Quantization	claim
16	135	Evaluation codes and plane valuations	claim
17	134	Generating More MNT Elliptic Curves	claim
18	129	Analysis of Redundant-Wavelet Multihypothesis for Motion Compensation	claim
19	126	A New Characterization of Semi-bent and Bent Functions on Finite Fields*	claim
20	122	On Efficient Quantizer Design for Robust Distributed Source Coding	claim
21	118	Making the Correct Mistakes	claim
22	116	Distortion Control for Queues with Deadlines	claim
23	116	Non-Asymptotic Design of Finite State Universal Predictors for Individual Sequences	claim
24	115	Compressed Data Structures: Dictionaries and Data-Aware Measures	claim
25	114	Trading Inversions for Multiplications in Elliptic Curve Cryptography	claim
26	114	Modeling Delta Encoding of Compressed Files	claim
27	114	Compression of Small Text Files using Syllables	claim
28	113	Error-Resilient LZW Data Compression	claim
29	110	Time-Sharing Vs. Source-Splitting in the Slepian-Wolf Problem: Error Exponents Analysis	claim
30	108	Quantized Indexing: Beyond Arithmetic Coding	claim
31	107	A Geometric Construction of the Hyperbolic Fibrations Associated with a Flock, q Even	claim
32	105	Index Calculation Attacks on RSA Signature and Encryption	claim
33	104	(6, 3)-MDS Codes over an Alphabet of Size 4	claim
34	104	Low-Complexity Compression of Short Messages	claim
35	104	Joint Source-Channel Decoding of Multiple Description Quantized Markov Sequences	claim
36	103	Self-Reciprocal Irreducible Pentanomials Over F2	claim
37	99	Roux-type constructions for covering arrays of strengths three and four	claim
38	97	On Relative Difference Sets in Dihedral Groups	claim
39	97	Data Compression with Restricted Parsings	claim
40	96	Codes with a Certain Weight-preserving Transitive Group of Automorphisms	claim
41	96	The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator	claim
42	95	Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences	claim
43	95	Tradeoffs in XML Database Compression	claim
44	94	A random construction for permutation codes and the covering radius	claim
45	94	On the Complexity of Optimal Grammar-Based Compression	claim
46	93	A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes	claim
47	91	Efficient Computation of Roots in Finite Fields	claim
48	90	Optimal (2, n) visual cryptographic schemes	claim
49	90	Toward a Source Coding Theory for Sets	claim
50	90	Efficient Rate Control for JPEG2000 Coder and Decoder	claim
51	89	On Ovoids of Parabolic Quadrics	claim
52	88	On the Number of Optimal Base 2 Representations of Integers	claim
53	86	New quasi-symmetric designs constructed using mutually orthogonal Latin squares and Hadamard matrices	claim
54	86	Faster Algorithm for Designing Optimal Prefix-Free Codes with Unequal Letter Costs	claim
55	85	Generalized Quadrangles with an Abelian Singer Group	claim
56	85	Quantization on the Complex Projective Space	claim
57	84	Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions	claim
58	84	A Practical Approach to Joint Network-Source Coding	claim
59	83	Practical Low Delay Broadcast of Compressed Variable Bit Rate Movies	claim
60	79	LDPC codes generated by conics in the classical projective plane	claim
61	79	A sequence of one-point codes from a tower of function fields	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers