Galois Hulls of Linear Codes over Finite Fields

September 21, 2018 ยท Declared Dead ยท ๐Ÿ› Designs, Codes and Cryptography

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Hongwei Liu, Xu Pan arXiv ID 1809.08053 Category cs.IT: Information Theory Citations 60 Venue Designs, Codes and Cryptography Last Checked 3 months ago
Abstract
The $\ell$-Galois hull $h_{\ell}(C)$ of an $[n,k]$ linear code $C$ over a finite field $\mathbb{F}_q$ is the intersection of $C$ and $C^{{\bot}_{\ell}}$, where $C^{\bot_{\ell}}$ denotes the $\ell$-Galois dual of $C$ which introduced by Fan and Zhang (2017). The $\ell$- Galois LCD code is a linear code $C$ with $h_{\ell}(C) = 0$. In this paper, we show that the dimension of the $\ell$-Galois hull of a linear code is invariant under permutation equivalence and we provide a method to calculate the dimension of the $\ell$-Galois hull by the generator matrix of the code. Moreover, we obtain that the dimension of the $\ell$-Galois hulls of ternary codes are also invariant under monomial equivalence. %The dimension of $l$-Galois hull of a code is not invariant under monomial equivalence if $q>4$. We show that every $[n,k]$ linear code over $\mathbb F_{q}$ is monomial equivalent to an $\ell$-Galois LCD code for any $q>4$. We conclude that if there exists an $[n,k]$ linear code over $\mathbb F_{q}$ for any $q>4$, then there exists an $\ell$-Galois LCD code with the same parameters for any $0\le \ell\le e-1$, where $q=p^e$ for some prime $p$. As an application, we characterize the $\ell$-Galois hull of matrix product codes over finite fields.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory

Died the same way โ€” ๐Ÿ‘ป Ghosted