✦ LIBER ✦

Anticodes for the Grassman and bilinear forms graphs

✍ Scribed by W. J. Martin; X. J. Zhu

Publisher: Springer
Year: 1995
Tongue: English
Weight: 309 KB
Volume: 6
Category: Article
ISSN: 0925-1022
DOI: 10.1007/bf01390772

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Codes and Anticodes in the Grassman Grap

Codes and Anticodes in the Grassman Graph

✍ Moshe Schwartz; Tuvi Etzion 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Perfect codes and optimal anticodes in the Grassman graph G q (n, k) are examined. It is shown that the vertices of the Grassman graph cannot be partitioned into optimal anticodes, with a possible exception when n=2k. We further examine properties of diameter perfect codes in the graph. These codes

A Unified Approach to a Characterization

A Unified Approach to a Characterization of Grassmann Graphs and Bilinear Forms Graphs

✍ Tung-Shan Fu; Tayuan Huang 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Wilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restrictions on parameters satisfy the dual of Pasch's axiom. Inspired by their work, a class of incidence structures associated with distance-regular graphs with classical parameters is studied in this paper. As a

Two remarks on Huang's characterization

Two remarks on Huang's characterization of the bilinear forms graphs

✍ Hans Cuypers 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 320 KB

Variational principles for symmetric bil

Variational principles for symmetric bilinear forms

✍ Jeffrey Danciger; Stephan Ramon Garcia; Mihai Putinar 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 197 KB

## Abstract Every compact symmetric bilinear form __B__ on a complex Hilbert space produces, via an antilinear representing operator, a real spectrum consisting of a sequence decreasing to zero. We show that the most natural analog of Courant's minimax principle for __B__ detects only the evenly in

Recurrence formula for expectations of p

Recurrence formula for expectations of products of bilinear forms and expectations of bilinear forms and random matrices

✍ G.A. Ghazal 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 100 KB

In this paper, we derive a recurrence formula for evaluating mathematical expectations of n j = 1

An analogue of the Erdös-Ko-Rado theorem

An analogue of the Erdös-Ko-Rado theorem for the distance-regular graphs of bilinear forms

✍ Tayuan Huang 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 425 KB

An analogue of the Erd6s-Ko-Rado theorem is proved for the distance-regular graphs Hq(k, n) with k x n matrices over GF(q) as vertex set and two matrices A and B adjacent if the rank of A -B is 1, where n >~ k + 1 and (n, q) ~ (k + 1, 2). As an easy corollary, we prove that Hq(k, n) has no perfect e