Sciweavers

437 search results - page 28 / 88
» Randomized Lattice Decoding
Sort
View
TIT
2008
102views more  TIT 2008»
14 years 11 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama
ICIP
2007
IEEE
15 years 6 months ago
Lossy Compression of Bilevel Images Based on Markov Random Fields
A new method for lossy compression of bilevel images based on Markov random fields (MRFs) is proposed. It preserves key structural information about the image, and then reconstru...
Matthew G. Reyes, Xiaonan Zhao, David L. Neuhoff, ...
78
Voted
STOC
1995
ACM
88views Algorithms» more  STOC 1995»
15 years 3 months ago
Linear-time encodable and decodable error-correcting codes
We present a new class of asymptotically good, linear error-correcting codes. These codes can be both encoded and decoded in linear time. They can also be encoded by logarithmic-d...
Daniel A. Spielman
89
Voted
INFOCOM
2009
IEEE
15 years 6 months ago
Robust Counting Via Counter Braids: An Error-Resilient Network Measurement Architecture
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
Yi Lu, Balaji Prabhakar
CORR
2007
Springer
115views Education» more  CORR 2007»
14 years 11 months ago
Error Exponents of Erasure/List Decoding Revisited via Moments of Distance Enumerators
The analysis of random coding error exponents pertaining to erasure/list decoding, due to Forney, is revisited. Instead of using Jensen’s inequality as well as some other inequa...
Neri Merhav