Search arXivSearch

arXiv · 2208.13389

Several classes of Galois self-orthogonal MDS codes and related applications

Abstract

Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is even). In this paper, we propose two general methods to construct $e$-Galois self-orthogonal (extended) generalized Reed-Solomon (GRS) codes. As a consequence, eight new classes of $e$-Galois self-orthogonal (extended) GRS codes with odd $q$ and $2e\mid h$ are obtained. Based on the Galois dual of a code, we also study its punctured and shortened codes. As applications, new $e'$-Galois self-orthogonal maximum distance separable (MDS) codes for all possible $e'$ satisfying $0\leq e'\leq h-1$, new $e$-Galois self-orthogonal MDS codes via the shortened codes, and new MDS codes with prescribed dimensional $e$-Galois hull via the punctured codes are derived. Moreover, some new $\sqrt{q}$-ary quantum MDS codes with lengths greater than $\sqrt{q}+1$ and minimum distances greater than $\frac{\sqrt{q}}{2}+1$ are obtained.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yang Li, Yunfei Su, Shixin Zhu, Shitao Li, Minjia Shi. 2023-02-09. Several classes of Galois self-orthogonal MDS codes and related applications. https://arxiv.org/abs/2208.13389

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT