Related papers: A Generic Construction on Self-orthogonal Algebrai…
This paper is concerned with the construction of algebraic geometric codes defined from GGS curves. It is of significant use to describe bases for the Riemann-Roch spaces associated with totally ramified places, which enables us to study…
We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4^m). We also provide examples of these codes some of which meet the known bounds for quantum codes.
Code-based Distributed Matrix Multiplication (DMM) has been extensively studied in distributed computing for efficiently performing large-scale matrix multiplication using coding theoretic techniques. The communication cost and recovery…
The main purpose of this paper is to further study the structure, parameters and constructions of the recently introduced minimal codes in the sum-rank metric. These objects form a bridge between the classical minimal codes in the Hamming…
In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…
In this note, an intrinsic description of some families of linear codes with symmetries is given, showing that they can be described more generally as quasi group codes, that is, as linear codes allowing a group of permutation automorphisms…
A unique decoding algorithm for general AG codes, namely multipoint evaluation codes on algebraic curves, is presented. It is a natural generalization of the previous decoding algorithm which was only for one-point AG codes. As such, it…
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…
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…
Maximum distance separable (in short, MDS), near MDS (in short, NMDS), and self-orthogonal codes play a pivotal role in algebraic coding theory, particularly in applications such as quantum communications and secret sharing scheme.…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
Algebraic-geometric codes on Garcia-Stichtenoth family of curves are used to construct the asymptotically good quantum codes.
Classes of self-dual codes and dual-containing codes are constructed. The codes are obtained within group rings and, using an isomorphism between group rings and matrices, equivalent codes are obtained in matrix form. Distances and other…
Let $\mathbb{F}_q$ be a finite field of $q$ elements, for some prime power $q$, and let $G$ be a finite group. A (left) group code, or simply a $G$-code, is a (left) ideal of the group algebra $\mathbb{F}_q[G]$. In this paper, we provide a…
Duadic group algebra codes are a generalization of quadratic residue codes. This paper settles an open problem raised by Zhu concerning the existence of duadic group algebra codes. These codes can be used to construct degenerate quantum…
In this paper we study the algebraic geometry of any two-point code on the Hermitian curve and reveal the purely geometric nature of their dual minimum distance. We describe the minimum-weight codewords of many of their dual codes through…
It's well known that MDS, AMDS or self dual codes have good algebraic properties, and are applied in communication systems, data storage, quantum codes, and so on. In this paper, we focus on a class of generalized Roth-Lempel linear codes…
Stacked quantum memory is an architecture in which multiple layers of qubits are stacked. Quantum rank-metric codes are effective for error correction in stacked quantum memories. However, the previously proposed quantum Gabidulin codes…
In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…
We give constructions of self-dual and formally self-dual codes from group rings where the ring is a finite commutative Frobenius ring. We improve the existing construction given in \cite{Hurley1} by showing that one of the conditions given…