2010
DOI: 10.1016/j.jcta.2010.05.006
|View full text |Cite
|
Sign up to set email alerts
|

Symmetric bilinear forms over finite fields of even characteristic

Abstract: Let S m be the set of symmetric bilinear forms on an m-dimensional vector space over GF(q), where q is a power of two. A subset Y of S m is called an (m, d)-set if the difference of every two distinct elements in Y has rank at least d. Such objects are closely related to certain families of codes over Galois rings of characteristic four.An upper bound on the size of (m, d)-sets is derived, and in certain cases, the rank distance distribution of an (m, d)-set is explicitly given. Constructions of (m, d)-sets ar… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
41
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 23 publications
(41 citation statements)
references
References 16 publications
0
41
0
Order By: Relevance
“…Then after an appropriate congruence transformation which keeps (18) and N ′ 6 , without loss of generality we may assume N = N ′ 5 = ϕ(M 3 ). We claim that ϕ(N ′ 6 ) is type two.…”
Section: Endomorphism and Maximal Cliquesmentioning
confidence: 99%
“…Then after an appropriate congruence transformation which keeps (18) and N ′ 6 , without loss of generality we may assume N = N ′ 5 = ϕ(M 3 ). We claim that ϕ(N ′ 6 ) is type two.…”
Section: Endomorphism and Maximal Cliquesmentioning
confidence: 99%
“…In the rest of this section, we consider a particular set of Z 4 -valued quadratic forms, which has been studied by the author in [6] following earlier work in [5].…”
Section: Z Z Z 4 -Valued Quadratic Formsmentioning
confidence: 99%
“…Families Q(2), Q (3), and Q (5), as defined by Helleseth and Kumar [1, p. 1832], and are the largest known designs among all binary sequence families with asymptotically the same period and maximum nontrivial correlation. Table 1 shows that Families V (0) and V (1) compare favourably to the small and the large Kasami set, respectively.…”
Section: Introductionmentioning
confidence: 99%
“…Regarding upper bounds for such d-codes, parts of the following results can be found in [16,Theorem 3.3] and [15,Corollary 7,Remark 8], and the last open case that q and d both even was proved in [14].…”
mentioning
confidence: 95%