Loading...
conference paper
Capacity-approaching codes on the q-ary symmetric channel for large q
2004
Proceedings of the IEEE Information Theory Workshop, 2004
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.
Type
conference paper
Web of Science ID
WOS:000226087200037
Authors
Publication date
2004
Published in
Proceedings of the IEEE Information Theory Workshop, 2004
Start page
204
End page
208
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
January 16, 2007
Use this identifier to reference this record