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 prove that any regular near hexagon with 729 vertices and lines of size 3 is derived from the ter...
It is proved that ternary codes with parameters [15,8,6], [15,9,5], [16,6,8], and [16,7,7] do not ex...
AbstractIf C̄ is a set of 36 ternary vectors of length 12, distance ⩾6, containing 0, then we show t...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
AbstractA new proof of the uniqueness and of the existence of the extended ternary Golay code is pre...
AbstractThe paper contains a proof of the uniqueness of both binary and ternary Golay codes, without...
The binary image of an extended cyclic code over F8 relatively to a self-dual basis of F8 is the GOL...
AbstractNew elementary proofs of the uniqueness of certain Steiner systems using coding theory are p...
AbstractSome combinatorial properties of the Golay binary code are emphasized and used for two main ...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
A ternary [69, 5, 45] code is constructed, thus solving the problem of finding the minimum length of...
Based on some results of Shult and Yanushka [7], Brouwer [1] proved that there exists a unique regul...
This thesis classifies all ordered quaternary Golay sequence pairs of length less than 22. Previous ...
AbstractIn this note we answer the following question in the affirmative: Is there a natural algebra...
We prove that any regular near hexagon with 729 vertices and lines of size 3 is derived from the ter...
It is proved that ternary codes with parameters [15,8,6], [15,9,5], [16,6,8], and [16,7,7] do not ex...
AbstractIf C̄ is a set of 36 ternary vectors of length 12, distance ⩾6, containing 0, then we show t...
AbstractA method is established to convert results from finite geometries to error-correcting codes....
AbstractA new proof of the uniqueness and of the existence of the extended ternary Golay code is pre...
AbstractThe paper contains a proof of the uniqueness of both binary and ternary Golay codes, without...
The binary image of an extended cyclic code over F8 relatively to a self-dual basis of F8 is the GOL...
AbstractNew elementary proofs of the uniqueness of certain Steiner systems using coding theory are p...
AbstractSome combinatorial properties of the Golay binary code are emphasized and used for two main ...
We give a new construction of the extended binary Golay code. The construction is carried out by tak...
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
A ternary [69, 5, 45] code is constructed, thus solving the problem of finding the minimum length of...
Based on some results of Shult and Yanushka [7], Brouwer [1] proved that there exists a unique regul...
This thesis classifies all ordered quaternary Golay sequence pairs of length less than 22. Previous ...
AbstractIn this note we answer the following question in the affirmative: Is there a natural algebra...
We prove that any regular near hexagon with 729 vertices and lines of size 3 is derived from the ter...
It is proved that ternary codes with parameters [15,8,6], [15,9,5], [16,6,8], and [16,7,7] do not ex...