9 search results - page 1 / 2 » On the Decoding Complexity of Cyclic Codes Up to the BCH Bou... |
CORR
2011
Springer
13 years 12 days ago
2011
Springer
—The standard algebraic decoding algorithm of cyclic codes [n, k, d] up to the BCH bound t is very efficient and practical for relatively small n while it becomes unpractical fo...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
— We address the problem of the algebraic decoding of any cyclic code up to the true minimum distance. For this, we use the classical formulation of the problem, which is to fin...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
In a distributed space-time coding scheme, based on the relay channel model, the relay nodes co-operate to linearly process the transmitted signal from the source and forward them ...
JSAC
2007
13 years 5 months ago
2007
Abstract— Distributed space-time coding is a means of achieving diversity through cooperative communication in a wireless relay network. In this paper, we consider a transmission...
ICS
2010
Tsinghua U.
13 years 9 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...