Related papers: On Galois LCD codes and LCPs of codes over mixed a…
In Cayley graphs on the additive group of a small vector space over GF$(q)$, $q=2,3$, we look for completely regular (CR) codes whose parameters are new in Hamming graphs over the same field. The existence of a CR code in such Cayley graph…
In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n \times n$ matrices to obtain LCD codes. Our construction method guarantees that…
Given a prime power $q$ and a positive integer $r>1$ we say that a cyclic code of length $n$, $C\subseteq F_{q^r}^n$, is Galois supplemented if for any non-trivial element $\sigma$ in the Galois group of the extension $ F_{q^r}/ F_q$,…
Random linear codes are a workhorse in coding theory, and are used to show the existence of codes with the best known or even near-optimal trade-offs in many noise models. However, they have little structure besides linearity, and are not…
Coded Distributed Matrix Multiplication (CDMM) is a distributed matrix multiplication (DMM) for large-scale matrices through a coding scheme such that any $R$ worker node among all $N$ worker nodes can recover the final product, where $N$…
In recent literature, matrix product (MP) codes and their duals have gained significant attention due to their application in the construction of quantum stabilizer codes. In this paper, we begin with providing a formula that characterizes…
Low density parity check (LDPC) codes, initially discovered by Gallager, exhibit excellent performance in iterative decoding, approaching the Shannon limit. MDS array codes, with favorable algebraic structures, are codes suitable for…
We study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potential energies when compared with all other codes of the same…
Let $m,e$ be positive integers, $p$ a prime number, $\mathbb{F}_{p^m}$ be a finite field of $p^m$ elements and $R=\mathbb{F}_{p^m}[u]/\langle u^e\rangle$ which is a finite chain ring. For any $\omega\in R^\times$ and positive integers $k,…
In this paper, we focus on decoding nonbinary low-density parity-check (LDPC) codes in Galois fields of characteristic two via the proximal alternating direction method of multipliers (proximal-ADMM). By exploiting…
The hull of a linear code is defined as the intersection of the code and its dual. This concept was initially introduced to classify finite projective planes. The hull plays a crucial role in determining the complexity of algorithms used to…
Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…
We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Repairable Codes (GLCRs) are exactly dual to linear index…
A set of linearly constrained permutation matrices are proposed for constructing a class of permutation codes. Making use of linear constraints imposed on the permutation matrices, we can formulate a minimum Euclidian distance decoding…
We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because…
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality…
We consider additive codes over GF(4) that are self-dual with respect to the Hermitian trace inner product. Such codes have a well-known interpretation as quantum codes and correspond to isotropic systems. It has also been shown that these…
This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…
We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing…
We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff and efficient list decoding up to the Johnson bound in polynomial time. Previous constructions of list decodable good distance…