Sciweavers

1245 search results - page 28 / 249
» Binary Sparse Coding
Sort
View
ISITA
2010
13 years 4 months ago
Optimality of LDGM-LDPC compound codes for lossy compression of binary erasure source
We consider the Binary Erasure Source (BES) introduced by Martinian and Yedidia. Based on the technique introduced by Martinian and Wainwright, we upper bound the rate-distortion p...
Gregory Demay, Vishwambhar Rathi, Lars K. Rasmusse...
TIT
2002
120views more  TIT 2002»
13 years 9 months ago
Finite-length analysis of low-density parity-check codes on the binary erasure channel
In this paper, we are concerned with the finite-length analysis of low-density parity-check (LDPC) codes when used over the binary erasure channel (BEC). The main result is an expr...
Changyan Di, David Proietti, Ì. Emre Telata...
ICIP
2001
IEEE
14 years 11 months ago
Color image coding, indexing and retrieval using binary space partitioning tree
This paper presents a unified approach to colour image coding, content-based indexing, and retrieval for database applications. The binary space partitioning (BSP) tree, tradition...
Guoping Qiu, S. Sudirman
EUROCRYPT
2012
Springer
12 years 2 days ago
Decoding Random Binary Linear Codes in 2 n/20: How 1 + 1 = 0 Improves Information Set Decoding
Decoding random linear codes is a well studied problem with many applications in complexity theory and cryptography. The security of almost all coding and LPN/LWE-based schemes rel...
Anja Becker, Antoine Joux, Alexander May, Alexande...
ICC
2007
IEEE
14 years 4 months ago
Low-Complexity, Low-Memory EMS Algorithm for Non-Binary LDPC Codes
— In this paper, we propose a new implementation of the EMS decoder for non binary LDPC codes presented in [7]. A particularity of the new algorithm is that it takes into account...
Adrian Voicila, David Declercq, François Ve...