DocumentCode :
936390
Title :
On the uniqueness of a certain thin near octagon (or partial 2-geometry, or parallelism) derived from the binary Golay code
Author :
Brouwer, A.E.
Volume :
29
Issue :
3
fYear :
1983
fDate :
5/1/1983 12:00:00 AM
Firstpage :
370
Lastpage :
371
Abstract :
The question of the uniqueness of a certain combinatorial structure has arisen in three contexts: a) is the regular near octagon with parameters 
unique [5]? b) is the partial 
-geometry with nexus three and blocksize 
unique [2]? c) is there a unique graph such that it is the graph of a parallelism of 
with respect to any [1]? We observe that these questions are equivalent and give an affirmative answer. In fact, we prove a more general theorem, showing the truth of a conjecture by Cameron.
unique [5]? b) is the partial -geometry with nexus three and blocksize unique [2]? c) is there a unique graph such that it is the graph of a parallelism of with respect to any [1]? We observe that these questions are equivalent and give an affirmative answer. In fact, we prove a more general theorem, showing the truth of a conjecture by Cameron.Keywords :
Golay coding; Bipartite graph; Retirement;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056664
Filename :
1056664
Link To Document :
