DOIAbstract
A general method of shortening a linear block code is introduced. Application of this shortening method to finite geometry codes produces a new class of majority-logic decodable codes
A general method of shortening a linear block code is introduced. Application of this shortening method to finite geometry codes produces a new class of majority-logic decodable codes
The aim of the paper is to expose the general laws for distribution of code words over hypercube edg...
We propose a new simple decomposable code construction technique that generates codes with the full ...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
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...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is disc...
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2) the d...
Typescript.Thesis (Ph. D.)--University of Hawaii at Manoa, 1974.Bibliography: leaves [112]-114.iv, 1...
International audienceWe develop three approaches of combinatorial flavour to study the structure of...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
AbstractThe homology groups of a finite geometry may be regarded as linear codes; and then the minim...
In this short note we state how we construct new good linear codes C over the finite field with q el...
Abstract. We demonstrate a majority-logic decoding algorithm for de-coding the generalised hyperocta...
Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve as...
The aim of the paper is to expose the general laws for distribution of code words over hypercube edg...
We propose a new simple decomposable code construction technique that generates codes with the full ...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
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...
International audienceIn this paper, we describe constructions of majority logic decodable codes whi...
A majority coset decoding (MCD) procedure that can be applied to an arbitrary geometric code is disc...
Majority-logic decoding is attractive for three reasons: (I) It can be simply implemented; (2) the d...
Typescript.Thesis (Ph. D.)--University of Hawaii at Manoa, 1974.Bibliography: leaves [112]-114.iv, 1...
International audienceWe develop three approaches of combinatorial flavour to study the structure of...
The polarity designs, introduced in [9], are combinatorial 2-designs having the same parameters as a...
AbstractThe homology groups of a finite geometry may be regarded as linear codes; and then the minim...
In this short note we state how we construct new good linear codes C over the finite field with q el...
Abstract. We demonstrate a majority-logic decoding algorithm for de-coding the generalised hyperocta...
Low density parity check (LDPC) codes with iterative decoding based on belief propagation achieve as...
The aim of the paper is to expose the general laws for distribution of code words over hypercube edg...
We propose a new simple decomposable code construction technique that generates codes with the full ...
This thesis shows how certain classes of binary constant weight codes can be represented geometrical...
Add to ORKG