Sciweavers

34 search results - page 2 / 7
» Linear-time encodable and decodable error-correcting codes
Sort
View
70
Voted
STOC
1995
ACM
88views Algorithms» more  STOC 1995»
15 years 1 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
STOC
2009
ACM
172views Algorithms» more  STOC 2009»
15 years 10 months ago
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
Marek Karpinski, Warren Schudy
SIGCOMM
1990
ACM
15 years 1 months ago
Reliable Broadband Communication Using a Burst Erasure Correcting Code
Traditionally, a transport protocol corrects errors in a computer communication network using a simple ARQ protocol. With the arrival of broadband networks, forward error correcti...
Anthony J. McAuley
ASAP
2005
IEEE
93views Hardware» more  ASAP 2005»
14 years 11 months ago
Instruction Set Extensions for Reed-Solomon Encoding and Decoding
Reed-Solomon codes are an important class of error correcting codes used in many applications related to communications and digital storage. The fundamental operations in Reed-Sol...
Suman Mamidi, Daniel Iancu, Andrei Iancu, Michael ...
ISCAS
2006
IEEE
100views Hardware» more  ISCAS 2006»
15 years 3 months ago
Decoders for low-density parity-check convolutional codes with large memory
— Low-density parity-check convolutional codes offer the same good error-correcting performance as low-density parity-check block codes while having the ability to encode and dec...
Stephen Bates, L. Gunthorpe, Ali Emre Pusane, Zhen...