1245 search results - page 120 / 249 » Binary Sparse Coding |
110
click to vote
IPL
2000
15 years 3 months ago
2000
Vajnovszki recently developed a loopless algorithm [Inform. Process. Lett. 68 (1998) 113] to enumerate Gray codes for binary trees, and then Korsh and Lafollette gave a loopless a...
151
Voted
TCOM
2010
15 years 2 months ago
2010
In this paper we formally analyze the interleaver and code design for QAM-based BICM transmissions using the binary reflected Gray code. We develop analytical bounds on the bit e...
124
Voted
TIT
2010
14 years 10 months ago
2010
We consider the Wyner-Ziv (WZ) problem of lossy compression where the decompressor observes a noisy version of the source, whose statistics are unknown. A new family of WZ coding a...
127
Voted
EWSN
2009
Springer
15 years 10 months ago
2009
Springer
Ensuring that every sensor node has the same code version is challenging in dynamic, unreliable multi-hop sensor networks. When nodes have different code versions, the network may...
127
Voted
COCOON
2009
Springer
15 years 10 months ago
2009
Springer
It has been known since [Zyablov and Pinsker 1982] that a random q-ary code of rate 1 − Hq(ρ) − ε (where 0 < ρ < 1 − 1/q, ε > 0 and Hq(·) is the q-ary entropy ...