Abstract ⎯ In order to use Berlekamp-Massey algorithm to decode the (89, 45, 17) binary quadratic residue code, one needs to determine two primary unknown syndromes. In this paper, the authors give some syndrome matrices, so as to calculate one primary unknown syndrome efficiently. This results in a reduction of decoding complexity in terms of CPU time by 35 % at least versus the decoder proposed by Truong et al
Abstract — Reed-Solomon codes are very useful and effective in burst error in noisy environment. In ...
[[abstract]]In this paper, we adopt a restricted Gaussian elimination on the Hankel structured augme...
Abstract: – We present division-free analogs of the accelerated Berlekamp-Massey (BM) algorithms of...
International audienceIn a recent article, Yi et al. proposed an algorithm for the decoding of binar...
Abstract—Recently, a novel decoding procedure which is called the syndrome-weight determination for ...
Includes bibliographical references (p. 39)Linear block codes are used in modern communication and d...
It is shown how binary polynomial residue codes which are equivalent in error-correcting power to sh...
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equati...
This paper investigates the error-correcting performance of (73,61,12) quadratic residue code over a...
Berlekamp Massey algorithm can be used to search the error locator polynomial quadratic residue code...
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadr...
International audienceWe adress the problem of the algebraic decoding of any cyclic code up to the t...
Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-o...
Abstract An algebraic decoding algorithm for the expurgated quadratic residue code of length 41 is p...
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equati...
Abstract — Reed-Solomon codes are very useful and effective in burst error in noisy environment. In ...
[[abstract]]In this paper, we adopt a restricted Gaussian elimination on the Hankel structured augme...
Abstract: – We present division-free analogs of the accelerated Berlekamp-Massey (BM) algorithms of...
International audienceIn a recent article, Yi et al. proposed an algorithm for the decoding of binar...
Abstract—Recently, a novel decoding procedure which is called the syndrome-weight determination for ...
Includes bibliographical references (p. 39)Linear block codes are used in modern communication and d...
It is shown how binary polynomial residue codes which are equivalent in error-correcting power to sh...
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equati...
This paper investigates the error-correcting performance of (73,61,12) quadratic residue code over a...
Berlekamp Massey algorithm can be used to search the error locator polynomial quadratic residue code...
In this paper, a low-complexity decoder based on a neural network is proposed to decode binary quadr...
International audienceWe adress the problem of the algebraic decoding of any cyclic code up to the t...
Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-o...
Abstract An algebraic decoding algorithm for the expurgated quadratic residue code of length 41 is p...
The decoding of arbitrary linear block codes is accomplished by solving a system of quadratic equati...
Abstract — Reed-Solomon codes are very useful and effective in burst error in noisy environment. In ...
[[abstract]]In this paper, we adopt a restricted Gaussian elimination on the Hankel structured augme...
Abstract: – We present division-free analogs of the accelerated Berlekamp-Massey (BM) algorithms of...