Sciweavers

314 search results - page 37 / 63
» Arithmetic Coding Revisited
Sort
View
APPROX
2005
Springer
96views Algorithms» more  APPROX 2005»
15 years 3 months ago
Tolerant Locally Testable Codes
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
Venkatesan Guruswami, Atri Rudra
SCN
2010
Springer
143views Communications» more  SCN 2010»
14 years 8 months ago
History-Free Aggregate Message Authentication Codes
Aggregate message authentication codes, as introduced by Katz and Lindell (CT-RSA 2008), combine several MACs into a single value, which has roughly the same size as an ordinary MA...
Oliver Eikemeier, Marc Fischlin, Jens-Fabian G&oum...
ICIP
2004
IEEE
15 years 11 months ago
Variable block-size transform and entropy coding at the enhancement layer of FGS
This paper proposes the variable block-size transform and context-based entropy coding techniques for the enhancement layer of FGS (Fine Granularity Scalable) video coding. First,...
Jungong Han, Xiaoyan Sun, Feng Wu, Shipeng Li, Zha...
ICMCS
2005
IEEE
116views Multimedia» more  ICMCS 2005»
15 years 3 months ago
Lossless image compression with tree coding of magnitude levels
With the rapid development of digital technology in consumer electronics, the demand to preserve raw image data for further editing or repeated compression is increasing. Traditio...
Hua Cai, Jiang Li
ICIP
2007
IEEE
15 years 11 months ago
Enable Efficient Compound Image Compression in H.264/AVC Intra Coding
This paper presents an efficient compound image compression approach based on H.264/AVC intra coding. The text blocks are distinguished from the picture blocks and compressed with...
Wenpeng Ding, Yan Lu, Feng Wu