Add to ORKGAbstract. We demonstrate a majority-logic decoding algorithm for de-coding the generalised hyperoctahedral group Cm wr Sn when thought of as an error-correcting code. We also find the complexity of this de-coding algorithm and compare it with that of another, more general, algorithm. Finally, we enumerate the number of error patterns exceed-ing the correction capability that can be successfully decoded by this algorithm, and analyse this asymptotically. 1
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group prope...
Abstract—Kulkarni and Kiyavash recently introduced a new method to establish upper bounds on the siz...
An estimate is given of the number of error patterns, of weight t plus 1, which a binary 1-step majo...
We demonstrate a majority-logic decoding algorithm for decoding the generalised hyperoctahedral gro...
AbstractWe replace the usual setting for error-correcting codes (i.e. vector spaces over finite fiel...
A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is disc...
We show how to use the elements of a sharply k-transitive permutation group of degree n to form erro...
(Communicated by the associate editor name) Abstract. The sporadic Mathieu group M12 can be viewed a...
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2) the d...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
Includes bibliographical references (page 36)The purpose of this project is to present error-correct...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
One-step majority logic decoding corrects not only all error patterns of weight t or less but also s...
The problem of constructing systematic error correcting codes has been stated as follows, “Construct...
Abstract—An iterative weighted reliability two-step majority logic decoding (IWRTS-MLGD) algorithm f...
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group prope...
Abstract—Kulkarni and Kiyavash recently introduced a new method to establish upper bounds on the siz...
An estimate is given of the number of error patterns, of weight t plus 1, which a binary 1-step majo...
We demonstrate a majority-logic decoding algorithm for decoding the generalised hyperoctahedral gro...
AbstractWe replace the usual setting for error-correcting codes (i.e. vector spaces over finite fiel...
A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is disc...
We show how to use the elements of a sharply k-transitive permutation group of degree n to form erro...
(Communicated by the associate editor name) Abstract. The sporadic Mathieu group M12 can be viewed a...
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2) the d...
This paper presents the outlines of elementary error-correcting codes. The first section is an intro...
Includes bibliographical references (page 36)The purpose of this project is to present error-correct...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
One-step majority logic decoding corrects not only all error patterns of weight t or less but also s...
The problem of constructing systematic error correcting codes has been stated as follows, “Construct...
Abstract—An iterative weighted reliability two-step majority logic decoding (IWRTS-MLGD) algorithm f...
A new decoding algorithm for geometrically uniform TCM schemes is proposed, based on the group prope...
Abstract—Kulkarni and Kiyavash recently introduced a new method to establish upper bounds on the siz...
An estimate is given of the number of error patterns, of weight t plus 1, which a binary 1-step majo...