2019
DOI: 10.1007/s10623-019-00681-2
|View full text |Cite
|
Sign up to set email alerts
|

Galois hulls of linear codes over finite fields

Abstract: The ℓ-Galois hull h ℓ (C) of an [n, k] linear code C over a finite field F q is the intersection of C and C ⊥ ℓ , where C ⊥ ℓ denotes the ℓ-Galois dual of C which introduced by Fan and Zhang (2017). The ℓ-Galois LCD code is a linear code C with h ℓ (C) = 0. In this paper, we show that the dimension of the ℓ-Galois hull of a linear code is invariant under permutation equivalence and we provide a method to calculate the dimension of the ℓ-Galois hull by the generator matrix of the code. Moreover, we obtain that… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

1
16
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 38 publications
(17 citation statements)
references
References 28 publications
1
16
0
Order By: Relevance
“…Suppose e is even and k = e/2. Then for a linear code C of type (n; k 1 , k 2 , d) over R with p k > 2, there exists a Hermitian LCD code C ′ which is equivalent to C over R.In other words, Theorems 4.3 and 4.6 generalise the results of [1, Corollaries 13, 18], concerning the constructions of Euclidean and Hermitian LCD codes over F q , to the k-Galois LCD codes over the chain ring R. Furthermore, Theorems 4.3 and 4.6 also generalise the results of[7, Theorem 4.8] introduced in[1].…”
supporting
confidence: 60%
See 1 more Smart Citation
“…Suppose e is even and k = e/2. Then for a linear code C of type (n; k 1 , k 2 , d) over R with p k > 2, there exists a Hermitian LCD code C ′ which is equivalent to C over R.In other words, Theorems 4.3 and 4.6 generalise the results of [1, Corollaries 13, 18], concerning the constructions of Euclidean and Hermitian LCD codes over F q , to the k-Galois LCD codes over the chain ring R. Furthermore, Theorems 4.3 and 4.6 also generalise the results of[7, Theorem 4.8] introduced in[1].…”
supporting
confidence: 60%
“…LetN = G(G (p e−k ) ) T andN ′ = G a (G (p e−k ) a ) T . ThenN ′ = G a (G (p e−k ) a ) T =N + diag k 1 +k 2 [u ′ ],160 R. Wu and M. Shi[7] where u ′ = (a p e−k +1 . .…”
mentioning
confidence: 99%
“…Recently, many scholars investigated Galois constacyclic codes over finite fields, see [3,15,25,26,27,29,30]. Motivated by their work, we introduce the definition of σself-reciprocal polynomials over finite fields.…”
Section: Discussionmentioning
confidence: 99%
“…The following proposition is a natural generalization to finite chain rings of [11,Proposition 2.2].…”
Section: Codes Over Chain Ringsmentioning
confidence: 99%