scispace - formally typeset
Open AccessJournal ArticleDOI

Association schemes, orthogonal arrays and codes from non-degenerate quadrics and hermitian varieties in finite projective geometries

I. M. Chakravarti
- 01 Jan 1990 - 
- Vol. 40, pp 89-96
Reads0
Chats0
TLDR
In this paper, the coexistence of and relations between association schemes, orthogonal arrays and certain families of projective codes have been examined, and two ways to construct association schemes from a projective code are presented.
Abstract
ABSTRACT: In this paper, coexistence of and relations between association schemes, orthogonal arrays and certain families of projective codes have been examined. The projective codes considered are linear spans of a nice projective set P in a hyperplane H = PG (N -1, s)-such as a quadric or a quadric with its nucleus of polarity or a Hermitian variety. There are two ways to construct association schemes from a projective code. One due to Delsarte (1973) considers the restriction of the Hamming scheme to the code with m weights and if it satisfies Delsarte's condition, an m-class association scheme is obtained by defining two codewords to be i-th associates if the Hamming distance between them is i, i = 0, 1, …, m. The alternative approach, first used by Ray-Chaudburi (1959) and later generalized by Mesner (1967) is to classify points (according to some geometrical criterion) in H = PG(N-1, s) with reference to P. into m types (say). Then, two points of the affine space EG(N, s) (for which H is the hyperplane at infinity) are defined to be i-th associates if the line joining the two points meet H at a point of type i, i = 1, …, m. In many cases, the two association schemes defined with respect to the same projective set have the same parameters. But Examples are given where they do not coincide and, in fact, there are cases where one scheme exists but the other does not.

read more

Content maybe subject to copyright    Report






References
More filters
Journal ArticleDOI

Codes projectifs à deux poids, “caps” complets et ensembles de différences

TL;DR: A deep connection between binary uniformily packed codes and difference sets over elementary Abelian 2-groups is established and a characterization of these difference sets is given.
Journal ArticleDOI

Some properties and applications of Hermitian varieties in a finite projective space PG(N, q2) in the construction of strongly regular graphs (two-class association schemes) and block designs

TL;DR: In this paper, the section of a non-degenerate Hermitian variety V N −1 by a polar hyperplane in PG( N, q 2 ) and the number of u -flats, 0 ≤ u ≤ [ (N − 1) 2 ], contained in a V n −1 are derived.
Book ChapterDOI

Families of Codes with Few Distinct Weights from Singular and Non-Singular Hermitian Varieties and Quadrics in Projective Geometries and Hadamard Difference Sets and Designs Associated with Two-Weight Codes

TL;DR: In this paper, the authors presented several doubly infinite families of linear projective codes with two-, three-and five distinct non-zero Hamming weights together with the frequency distributions of their weights.

On the application of the geometry of quadrics to the construction of partially balanced incomplete block designs and error correcting binary codes

TL;DR: In this paper, the authors express their deep gratitude to Professor R. C. Bose, for suggesting the problem herein considered and providing guidance and encouragement during the course of their investigation.
Related Papers (5)