English
Related papers

Related papers: On additive MDS codes with linear projections

200 papers

We consider quantum MDS (QMDS) codes for quantum systems of dimension $q$ with lengths up to $q^2+2$ and minimum distances up to $q+1$. We show how starting from QMDS codes of length $q^2+1$ based on cyclic and constacyclic codes, new QMDS…

Quantum Physics · Physics 2016-01-25 Markus Grassl , Martin Roetteler

For a linear code $C$ of length $n$ with dimension $k$ and minimum distance $d$, it is desirable that the quantity $kd/n$ is large. Given an arbitrary field $\mathbb{F}$, we introduce a novel, but elementary, construction that produces a…

Information Theory · Computer Science 2021-10-05 Faezeh Alizadeh , S. P. Glasby , Cheryl E. Praeger

Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…

Information Theory · Computer Science 2022-01-05 Swati Bhardwaj , Madhu Raka

We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…

Information Theory · Computer Science 2019-11-26 Lin Sok

Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of $q$-ary MDS self-dual codes for…

Information Theory · Computer Science 2016-12-26 Lingfei Jin , Chaoping Xing

The purpose of this paper is to present the structure of the linear codes over a finite field with q elements that have a permutation automorphism of order m. These codes can be considered as generalized quasi-cyclic codes. Quasi-cyclic…

Information Theory · Computer Science 2024-02-05 Stefka Bouyuklieva

In this article we prove Griesmer type bounds for additive codes over finite fields. These new bounds give upper bounds on the length of maximum distance separable (MDS) codes, codes which attain the Singleton bound. We will also consider…

Information Theory · Computer Science 2025-12-17 Simeon Ball , Michel Lavrauw , Tabriz Popatia

In this paper, we completely determine the number of solutions to $ \operatorname{Tr}^{q^2}_q(bx+b)+c=0, x\in \mu_{q+1}\backslash \{-1\}$ for all $b\in \mathbb{F}_{q^2}, c\in\mathbb{F}_{q}$. As an application, we can give the weight…

Information Theory · Computer Science 2023-04-11 Wei Lu , Xia Wu

In this work we present results on the classification of $\mathbb{F}_{q^n}$-linear MRD codes of dimension three. In particular, using connections with certain algebraic varieties over finite fields, we provide non-existence results for MRD…

Information Theory · Computer Science 2024-03-05 Daniele Bartoli , Francesco Ghiandoni

A linear code with a complementary dual (or LCD code) is defined to be a linear code $C$ whose dual code $C^{\perp}$ satisfies $C \cap C^{\perp}$= $\left\{ \mathbf{0}\right\} $. Let $LCD{[}n,k{]}$ denote the maximum of possible values of…

Information Theory · Computer Science 2017-01-17 Lucky Galvez , Jon-Lark Kim , Nari Lee , Young Gun Roe , Byung-Sun Won

Let $\mathbb{F}_q$ be the finite field of $q$ elements, where $q=p^{m}$ with $p$ being a prime number and $m$ being a positive integer. Let $\mathcal{C}_{(q, n, \delta, h)}$ be a class of BCH codes of length $n$ and designed $\delta$. A…

Information Theory · Computer Science 2024-08-21 Shiyuan Qiang , Huakai Wei , Shaofang Hong

In [A. Neri, P. Santonastaso, F. Zullo. Extending two families of maximum rank distance codes], the authors extended the family of $2$-dimensional $\mathbb{F}_{q^{2t}}$-linear MRD codes recently found in [G. Longobardi, G. Marino, R.…

Information Theory · Computer Science 2023-03-29 S. Gupta , G. Longobardi , R. Trombetti

Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…

Information Theory · Computer Science 2021-10-27 Ted Hurley , Donny Hurley , Barry Hurley

Near maximum distance separable (NMDS) codes are important in finite geometry and coding theory. Self-dual codes are closely related to combinatorics, lattice theory, and have important application in cryptography. In this paper, we…

Combinatorics · Mathematics 2023-08-04 Dongchun Han , Hanbin Zhang

Linear codes in the projective space $\mathbb{P}_q(n)$, the set of all subspaces of the vector space $\mathbb{F}_q^n$, were first considered by Braun, Etzion and Vardy. The Grassmannian $\mathbb{G}_q(n,k)$ is the collection of all subspaces…

Information Theory · Computer Science 2021-07-23 Pranab Basu

In this article, the effective lengths of all $q^r$-divisible linear codes over $\mathbb{F}_q$ with a non-negative integer $r$ are determined. For that purpose, the $S_q(r)$-adic expansion of an integer $n$ is introduced. It is shown that…

Combinatorics · Mathematics 2020-01-31 Michael Kiermaier , Sascha Kurz

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu

Let $V$ denote an $r$-dimensional $\mathbb{F}_{q^n}$-vector space. For an $m$-dimensional $\mathbb{F}_q$-subspace $U$ of $V$ assume that $\dim_q \left(\langle {\bf v}\rangle_{\mathbb{F}_{q^n}} \cap U\right) \geq 2$ for each non zero vector…

Combinatorics · Mathematics 2025-01-27 Bence Csajbók , Giuseppe Marino , Valentina Pepe

Higher order MDS codes are an interesting generalization of MDS codes recently introduced by Brakensiek, Gopi and Makam (IEEE Trans. Inf. Theory 2022). In later works, they were shown to be intimately connected to optimally list-decodable…

Information Theory · Computer Science 2024-08-22 Joshua Brakensiek , Manik Dhar , Sivakanth Gopi

The weights in MDS codes of length n and dimension k over the finite field GF(q) are studied. Up to some explicit exceptional cases, the MDS codes with parameters given by the MDS conjecture are shown to contain all k weights in the range…

Information Theory · Computer Science 2011-03-31 Martianus Frederic Ezerman , Markus Grassl , Patrick Sole
‹ Prev 1 3 4 5 6 7 10 Next ›