Sciweavers

6 search results - page 1 / 2
» Error-correcting codes on projective bundles
Sort
View
111
Voted
TIT
2008
110views more  TIT 2008»
15 years 29 days ago
Explicit Codes Achieving List Decoding Capacity: Error-Correction With Optimal Redundancy
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
Venkatesan Guruswami, Atri Rudra
93
Voted
FFA
2006
63views more  FFA 2006»
15 years 1 months ago
Error-correcting codes on projective bundles
Tohru Nakashima
95
Voted
ICCAD
2007
IEEE
137views Hardware» more  ICCAD 2007»
15 years 10 months ago
Combining static and dynamic defect-tolerance techniques for nanoscale memory systems
Abstract— Nanoscale technology promises dramatically increased device density, but also decreased reliability. With bit error rates projected to be as high as 10%, designing a us...
Susmit Biswas, Gang Wang, Tzvetan S. Metodi, Ryan ...
142
Voted
WD
2010
14 years 11 months ago
Enhancing FEC application in LTE cellular networks
3rd Generation Partnership Project's (3GPP) Long Term Evolution (LTE) is focused on enhancing the Universal Terrestrial Radio Access (UTRA). Evolved-Multimedia Broadcast and M...
Antonios G. Alexiou, Christos Bouras, Vasileios Ko...
116
Voted
DCC
2005
IEEE
16 years 20 days ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...