ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

Anticodes for the Grassman and bilinear forms graphs (1995)

Martin, W. J. ; Zhu, X. J.

Springer

Designs, codes and cryptography 6 (1995), S. 73-79

add to mindlist on the mindlist

Details

ISSN: 1573-7586

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract In [2], L. Chihara proved that many infinite families of classical distance-regular graphs have no nontrivial perfect codes, including the Grassman graphs and the bilinear forms graphs. Here, we present a new proof of her result for these two families using Delsarte's anticode condition[3]. The technique is an extension of an approach taken by C. Roos [6] in the study of perfect codes in the Johnson graphs.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01390772

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit