7 search results - page 1 / 2 » On formulas for decoding binary cyclic codes |
CORR
2007
Springer
13 years 7 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
2011
Springer
13 years 2 months 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
2010
Springer
13 years 4 months ago
2010
Springer
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
WCC
2005
Springer
14 years 24 days ago
2005
Springer
This paper is devoted to the study of the weights of binary irreducible cyclic codes. We start from McEliece’s interpretation of these weights by means of Gauss sums. Firstly, a ...
ICIP
2006
IEEE
14 years 9 months ago
2006
IEEE
In this paper, we propose a novel efficient scheme for robust video transmission over wireless channels. The schema consists of motion compensated spatio-temporal wavelet decompos...