74 search results - page 7 / 15 » arscom 2007 |
ARSCOM
1999
14 years 9 months ago
1999
For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,
ARSCOM
2007
14 years 9 months ago
2007
We construct a record-breaking binary code of length 17, minimal distance 6, constant weight 6, and containing 113 codewords.
ARSCOM
2006
14 years 9 months ago
2006
Automorphisms of Steiner 2-designs S(2, 4, 37) are studied and used to find many new examples. Some of the constructed designs have S(2, 3, 9) subdesigns, closing the last gap in t...
ARSCOM
2006
14 years 9 months ago
2006
We show that permutation decoding can be used, and give explicit PD-sets in the symmetric group, for some of the binary codes obtained from the adjacency matrices of the graphs on...
ARSCOM
2006
14 years 9 months ago
2006
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...