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
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

The Geometry of Two-Weight Codes

TL;DR: On etudie les relations entre les codes [n,k] lineaires a deux poids, les ensembles projectifs et certains graphes fortement reguliers as mentioned in this paper.
Journal ArticleDOI

Four fundamental parameters of a code and their combinatorial significance

TL;DR: A method is suggested to calculate the weight distributions of cosets of a code and a “dual concept” of that of perfect codes is presented and examined in detail.
Journal ArticleDOI

Orthogonal Arrays of Strength two and three

TL;DR: In this article, the known upper bounds for the maximum possible number of constraints for arrays of strength 2 and 3 have been improved, and certain methods for constructing these arrays have been given.
Journal ArticleDOI

On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs

TL;DR: In the United States, any part of the Internet is available for any purpose of the United states Government as discussed by the authors, i.e., search, download, upload, and share.
Journal ArticleDOI

Weights of linear codes and strongly regular normed spaces

Ph. Delsarte
- 01 Jan 1972 - 
TL;DR: It is shown that every strongly regular normed space admits a representation by means of a projective code, which yields a one-to-one correspondence between two-weight projective codes over prime fields and some strongly regular graphs.
Related Papers (5)