DOIAbstract
A new class is defined of geometric codes that are majority logic decodable up to their minimum distance. Using the quasicyclic structure of the codes, one describes a very simple decoding procedure
A new class is defined of geometric codes that are majority logic decodable up to their minimum distance. Using the quasicyclic structure of the codes, one describes a very simple decoding procedure
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes a...
AbstractA new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on t...
This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes...
A general method of shortening a linear block code is introduced. Application of this shortening met...
A new class is defined of geometric codes that are majority logic decodable up to their minimum dist...
A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is disc...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2) the d...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
International Telemetering Conference Proceedings / October 09-11, 1973 / Sheraton Inn Northeast, Wa...
Typescript.Thesis (Ph. D.)--University of Hawaii at Manoa, 1974.Bibliography: leaves [112]-114.iv, 1...
In the presented work we define a class of error-correcting codes based on incidence vectors of proj...
Abstract. We demonstrate a majority-logic decoding algorithm for de-coding the generalised hyperocta...
Abstract—An iterative weighted reliability two-step majority logic decoding (IWRTS-MLGD) algorithm f...
A new decoding algorithm for geometrically uniform trellis codes exploiting the group structure of t...
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes a...
AbstractA new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on t...
This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes...
A general method of shortening a linear block code is introduced. Application of this shortening met...
A new class is defined of geometric codes that are majority logic decodable up to their minimum dist...
A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is disc...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2) the d...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
International Telemetering Conference Proceedings / October 09-11, 1973 / Sheraton Inn Northeast, Wa...
Typescript.Thesis (Ph. D.)--University of Hawaii at Manoa, 1974.Bibliography: leaves [112]-114.iv, 1...
In the presented work we define a class of error-correcting codes based on incidence vectors of proj...
Abstract. We demonstrate a majority-logic decoding algorithm for de-coding the generalised hyperocta...
Abstract—An iterative weighted reliability two-step majority logic decoding (IWRTS-MLGD) algorithm f...
A new decoding algorithm for geometrically uniform trellis codes exploiting the group structure of t...
The concept of an error-correcting array gives a new bound on the minimum distance of linear codes a...
AbstractA new effective decoding algorithm is presented for arbitrary algebraic-geometric codes on t...
This paper provides a survey of the existing literature on the decoding of algebraic-geometric codes...
Add to ORKG