Electronic Resource
Springer
Graphs and combinatorics
3 (1987), S. 25-38
ISSN:
1435-5914
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
,
Mathematics
Notes:
Abstract One of the main results says that ifC is a binary linear code of length 4t and of dimension greater than 2t, thenC contains a word of weight 2t and this bound is best possible. Several results of similar flavor are established both for linear and non-linear codes. For the proof a lemma introducing the binormal forms of binary matrices is needed. The results are applied to determine the coset chromatic number of Hadamard graphs, to solve a problem of Galvin and to give a short proof of a theorem of Gleason on self-dual doubly-even codes.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01788526
Permalink
Library |
Location |
Call Number |
Volume/Issue/Year |
Availability |