Sciweavers

1310 search results - page 48 / 262
» On a Class of Traceability Codes
Sort
View
CORR
2007
Springer
155views Education» more  CORR 2007»
14 years 11 months ago
Low-density graph codes that are optimal for source/channel coding and binning
We describe and analyze the joint source/channel coding properties of a class of sparse graphical codes based on compounding a low-density generator matrix (LDGM) code with a low-...
Martin J. Wainwright, Emin Martinian
P2P
2008
IEEE
137views Communications» more  P2P 2008»
15 years 5 months ago
Hierarchical Codes: How to Make Erasure Codes Attractive for Peer-to-Peer Storage Systems
Redundancy is the basic technique to provide reliability in storage systems consisting of multiple components. A redundancy scheme defines how the redundant data are produced and...
Alessandro Duminuco, Ernst Biersack
ICIP
2008
IEEE
16 years 26 days ago
On the coding gain of separable 2D wavelet filter banks
It has been observed that filter banks from a certain popular separable 2D wavelet class always appear to have a higher coding gain with respect to a separable image model than wi...
Michael D. Adams
FFA
2007
56views more  FFA 2007»
14 years 11 months ago
Optical orthogonal codes and arcs in PG(d, q)
We present a new construction for (n, w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal ratio...
T. L. Alderson
TIT
2008
107views more  TIT 2008»
14 years 11 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak