2019
DOI: 10.3906/mat-1905-103
|View full text |Cite
|
Sign up to set email alerts
|

Extending self-orthogonal codes

Abstract: In this short note we give an exact count for the number of self-dual codes over a finite field Fq of odd characteristic containing a given self-orthogonal code. This generalizes an analogous result of MacWilliams, Sloane, and Thompson over the field F2 to arbitrary odd finite fields Fq .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 4 publications
0
2
0
Order By: Relevance
“…where α i ∈ F p , and χ(α) := ζ α 0 p , where ζ p is the primitive p-th root e 2πi/ p of unity, and α 0 is given by (1).…”
Section: Macwilliams Identitymentioning
confidence: 99%
See 1 more Smart Citation
“…where α i ∈ F p , and χ(α) := ζ α 0 p , where ζ p is the primitive p-th root e 2πi/ p of unity, and α 0 is given by (1).…”
Section: Macwilliams Identitymentioning
confidence: 99%
“…Let C ⊆ F n 3 be a self-orthogonal code of dimension k. We denote by N III n,k the number of Type III codes over F 3 of length n containing C . Then from [1] we have…”
Section: Now Let Us Definementioning
confidence: 99%