English
Related papers

Related papers: On self-dual MRD codes

200 papers

In this paper we characterize the algebraic structure of two-dimensional $(\alpha,\beta )$-constacyclic codes of arbitrary length $s.\ell$ and of their duals. For $\alpha,\beta \in \{1,-1\}$, we give necessary and sufficient conditions for…

Information Theory · Computer Science 2020-07-30 Swati Bhardwaj , Madhu Raka

We show that every self-orthogonal code over $\mathbb F_q$ of length $n$ can be extended to a self-dual code, if there exists self-dual codes of length $n$. Using a family of Galois towers of algebraic function fields we show that over any…

Information Theory · Computer Science 2017-09-22 Alp Bassa , Henning Stichtenoth

We define linear and semilinear isometry for general subspace codes, used for random network coding. Furthermore, some results on isometry classes and automorphism groups of known constant dimension code constructions are derived.

Information Theory · Computer Science 2014-06-20 Anna-Lena Trautmann

This work explores LCD and self-dual codes over a noncommutative non-unital ring $ E_p= \langle r,s ~|~ pr =ps=0,~ r^2=r,~ s^2=s,~ rs=r,~ sr=s \rangle$ of order $p^2$ where $p$ is a prime. Initially, we study the monomial equivalence of two…

Information Theory · Computer Science 2025-01-23 Anup Kushwaha , Indibar Debnath , Om Prakash

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

Self-dual codes over finite fields and over some finite rings have been of interest and extensively studied due to their nice algebraic structures and wide applications. Recently, characterization and enumeration of Euclidean self-dual…

Information Theory · Computer Science 2019-09-10 Parinyawat Choosuwan , Somphong Jitman

In this work, we give three new techniques for constructing Hermitian self-dual codes over commutative Frobenius rings with a non-trivial involutory automorphism using $\lambda$-circulant matrices. The new constructions are derived as…

Combinatorics · Mathematics 2023-01-18 Adam Michael Roberts

In this paper, constructions of some double circulant self-dual codes by generalized cyclotomic classes of order two are presented. This technique is applied to [72, 36, 12] binary highest know self-dual codes to obtain self-dual codes over…

Information Theory · Computer Science 2019-12-16 Wenpeng Gao , Tongjiang Yan

In this paper we give the structure of constacyclic codes over formal power series and chain rings. We also present necessary and sufficient conditions on the existence of MDS codes over principal ideal rings. These results allow for the…

Information Theory · Computer Science 2012-07-17 Kenza Guenda , T. Aaron Gulliver

We introduce an altered version of the four circulant construction over group rings for self-dual codes. We consider this construction over the binary field, the rings F_2 + uF_2 and F_4 + uF_4; using groups of order 3, 7, 9, 13, and 15.…

Combinatorics · Mathematics 2019-12-30 Joe Gildea , Abidin Kaya , Alexander Tylyshchak , Bahattin Yildiz

In this work we study automorphisms of synchronous self-similar groups, the existence of extensions to automorphisms of the full group of automorphisms of the infinite rooted tree on which these groups act on. When they do exist, we obtain…

Group Theory · Mathematics 2019-04-08 Francesco Matucci , Pedro V. Silva

This paper investigates the theory of sum-rank metric codes for which the individual matrix blocks may have different sizes. Various bounds on the cardinality of a code are derived, along with their asymptotic extensions. The duality theory…

Information Theory · Computer Science 2020-10-07 Eimear Byrne , Heide Gluesing-Luerssen , Alberto Ravagnani

We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal…

Information Theory · Computer Science 2019-01-15 Xavier Caruso , Amaury Durand

The aim of this work is to study the structure and properties of the binary LCD codes having an automorphisms of odd prime order and to present a method for their construction.

Information Theory · Computer Science 2021-08-04 Stefka Bouyuklieva , Javier de la Cruz

In this paper, we present a new bordered construction for self-dual codes which employs $\lambda$-circulant matrices. We give the necessary conditions for our construction to produce self-dual codes over a finite commutative Frobenius ring…

Information Theory · Computer Science 2023-03-24 Joe Gildea , Adrian Korban , Adam Michael Roberts , Alexander Tylyshchak

This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors. Space-symmetric errors are additive error matrices that have the property that their column and row spaces are…

Information Theory · Computer Science 2021-02-05 Thomas Jerkovits , Vladimir Sidorenko , Antonia Wachter-Zeh

We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…

Number Theory · Mathematics 2017-06-26 Pınar Çomak , Jon-Lark Kim , Ferruh Özbudak

Twisted Gabidulin codes are an extension of Gabidulin codes and have recently attracted great attention. In this paper, we study three classes of twisted Gabidulin codes with different twists. Moreover, we establish necessary and sufficient…

Information Theory · Computer Science 2025-09-17 Ran Li , Fang-Wei Fu , Weijun Fang

In this paper, by using some properties for linear algebra methods, the parity-check matrices for twisted generalized Reed-Solomon codes with any given hook $h$ and twist $t$ are presented, and then a sufficient and necessary condition for…

Information Theory · Computer Science 2022-09-07 Canze Zhu , Qunying Liao

Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…

Information Theory · Computer Science 2017-05-30 Ashkan Nikseresht