1245 search results - page 21 / 249 » Binary Sparse Coding |
CORR
2006
Springer
13 years 9 months ago
2006
Springer
We describe and analyze sparse graphical code constructions for the problems of source coding with decoder side information (the Wyner-Ziv problem), and channel coding with encoder...
EJC
2007
13 years 9 months ago
2007
We examine the binary codes obtained from the row span over the field F2 of an adjacency matrix of the rectangular lattice graphs L2(m, n) for 3 ≤ m < n and show that permut...
GLOBECOM
2008
IEEE
14 years 4 months ago
2008
IEEE
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
In this paper we study various chain codes, which are representations of binary image contours, in terms of their ability to compress in the best way the contour information using...
CODCRY
2011
Springer
13 years 1 months ago
2011
Springer
This paper presents a list-decoding algorithm for classical irreducible binary Goppa codes. The algorithm corrects, in polynomial time, approximately n − p n(n − 2t − 2) err...