Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

26

STOC
1995
ACM

favoriteEmaildiscussreport

88views Algorithms» more STOC 1995»

Linear-time encodable and decodable error-correcting codes

14 years 2 months ago

Linear-time encodable and decodable error-correcting codes

Download cs-www.cs.yale.edu

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-depth circuits of linear size and decoded by logarithmic depth circuits of size O(n log n). We present both randomized and explicit constructions of these codes.

Daniel A. Spielman

Real-time Traffic

Algorithms | Linear Error-correcting Codes | Linear Time | Logarithmic Depth Circuits | STOC 1995 |

claim paper

Related Content

» Linear time decoding of realfield codes over high error rate channels

» Approaching BlokhZyablov Error Exponent with LinearTime EncodableDecodable Codes

» Linear time encodable and list decodable codes

» ErrorCorrecting Data Structures

» Linear Time Erasure Codes with Nearly Optimal Recovery Extended Abstract

» Linear time approximation schemes for the GaleBerlekamp game and related minimization prob...

» Reliable Broadband Communication Using a Burst Erasure Correcting Code

» Instruction Set Extensions for ReedSolomon Encoding and Decoding

» Decoders for lowdensity paritycheck convolutional codes with large memory

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	STOC
Authors	Daniel A. Spielman

Comments (0)