DocumentCode
2142877
Title
Models of computation in coding theory
Author
Spielman, Daniel A.
Author_Institution
Dept. of Math., MIT, Cambridge, MA, USA
fYear
1998
fDate
15-18 Jun 1998
Firstpage
120
Abstract
In this paper, we contrast some fundamental assumptions of coding theory with those used in complexity theory. In particular, we explain the differences in algorithms used in the software and hardware implementations of Reed-Solomon codes. We also explain how, when studying error-correcting codes, one must consider energy and communication delay to be resources, in addition to the usual space and time
Keywords
Reed-Solomon codes; computational complexity; encoding; Reed-Solomon codes; coding theory; communication delay; complexity theory; error-correcting codes; hardware implementations; models of computation; Combinatorial mathematics; Complexity theory; Computational modeling; Decoding; Delay effects; Error correction codes; Fast Fourier transforms; Hardware; Reed-Solomon codes; Software algorithms;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Complexity, 1998. Proceedings. Thirteenth Annual IEEE Conference on
Conference_Location
Buffalo, NY
ISSN
1093-0159
Print_ISBN
0-8186-8395-3
Type
conf
DOI
10.1109/CCC.1998.694597
Filename
694597
Link To Document