DocumentCode :
2769286
Title :
Capacity-approaching codes on the q-ary symmetric channel for large q
Author :
Shokrollahi, Amin
Author_Institution :
Dept. of Math., Ecole Polytech. Fed. de Lausanne, Switzerland
fYear :
2004
fDate :
24-29 Oct. 2004
Firstpage :
204
Lastpage :
208
Abstract :
We give a short survey of several techniques to construct codes on GF(q) that approach the capacity of the q-ary symmetric channel. The q-ary symmetric channel represents the next level of difficulty after the binary erasure channel (BEC). Since the channel is more complex than the BEC, one may hope that codes and decoding algorithms that approach the capacity of this channel for large q may be modified to yield capacity-approaching codes for smaller values of q as well.
Keywords :
Galois fields; channel capacity; channel coding; decoding; error statistics; Galois fields; capacity-approaching codes; channel capacity; decoding algorithms; q-ary symmetric channel; Capacity planning; Channel capacity; Computer errors; Computer science; Cyclic redundancy check; Mathematics; Maximum likelihood decoding; Parity check codes; Polynomials; Random variables;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Workshop, 2004. IEEE
Print_ISBN :
0-7803-8720-1
Type :
conf
DOI :
10.1109/ITW.2004.1405300
Filename :
1405300
Link To Document :
بازگشت