AbstractIf C̄ is a set of 36 ternary vectors of length 12, distance ⩾6, containing 0, then we show that the supports of the weight 6 vectors in C̄ hold an S(5, 6, 12). Further we show that C̄ must be a linear, self-dual [12, 6, 6] code, hence the Golay code.Also any set C of 36 ternary vectors of length 11, distance ⩾5, containing 0, is linear and hence the Golay [11, 6, 6] code. The supports of the vectors of weight 5 in C hold an S(4, 5, 11).Similarities and differences with the binary case are discussed
AbstractIn this note we answer the following question in the affirmative: Is there a natural algebra...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
∗ This work was supported in part by the Bulgarian NSF under Grant MM-901/99In this paper we prove t...
AbstractIf C̄ is a set of 36 ternary vectors of length 12, distance ⩾6, containing 0, then we show t...
AbstractThe paper contains a proof of the uniqueness of both binary and ternary Golay codes, without...
AbstractSome combinatorial properties of the Golay binary code are emphasized and used for two main ...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
AbstractNew elementary proofs of the uniqueness of certain Steiner systems using coding theory are p...
The binary image of an extended cyclic code over F8 relatively to a self-dual basis of F8 is the GOL...
AbstractA new proof of the uniqueness and of the existence of the extended ternary Golay code is pre...
AbstractThe paper contains a proof that all binary linear [18, 9, 6] codes are equivalent to the ext...
Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct s...
AbstractA complete classification is given of all [22, 11] and [24, 12] binary self-dual codes. For ...
AbstractWe give a new proof for the theorem of Conway and Pless that there are exactly five binary l...
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
AbstractIn this note we answer the following question in the affirmative: Is there a natural algebra...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
∗ This work was supported in part by the Bulgarian NSF under Grant MM-901/99In this paper we prove t...
AbstractIf C̄ is a set of 36 ternary vectors of length 12, distance ⩾6, containing 0, then we show t...
AbstractThe paper contains a proof of the uniqueness of both binary and ternary Golay codes, without...
AbstractSome combinatorial properties of the Golay binary code are emphasized and used for two main ...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
AbstractNew elementary proofs of the uniqueness of certain Steiner systems using coding theory are p...
The binary image of an extended cyclic code over F8 relatively to a self-dual basis of F8 is the GOL...
AbstractA new proof of the uniqueness and of the existence of the extended ternary Golay code is pre...
AbstractThe paper contains a proof that all binary linear [18, 9, 6] codes are equivalent to the ext...
Two product array codes are used to construct the (24, 12, 8) binary Golay code through the direct s...
AbstractA complete classification is given of all [22, 11] and [24, 12] binary self-dual codes. For ...
AbstractWe give a new proof for the theorem of Conway and Pless that there are exactly five binary l...
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
AbstractIn this note we answer the following question in the affirmative: Is there a natural algebra...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
∗ This work was supported in part by the Bulgarian NSF under Grant MM-901/99In this paper we prove t...