Related papers: Coxeter codes: Extending the Reed-Muller family
A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be…
The aim of this paper is first to introduce and study Rota-Baxter cosystems and bisystems as generalization of Rota-Baxter coalgebras and bialgebras, respectively, with various examples. The second purpose is to provide an alternative…
We give a polynomial time algorithm to decode multivariate polynomial codes of degree $d$ up to half their minimum distance, when the evaluation points are an arbitrary product set $S^m$, for every $d < |S|$. Previously known algorithms can…
Automorphism Ensemble (AE) decoding has recently drawn attention as a possible alternative to list decoding of polar codes. In this letter, we investigate the distribution of Partially-Symmetric Reed-Muller (PS-RM) codes, a family of polar…
Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…
We classify all $q$-ary $\Delta$-divisible linear codes which are spanned by codewords of weight $\Delta$. The basic building blocks are the simplex codes, and for $q=2$ additionally the first order Reed-Muller codes and the parity check…
We consider the problem of coded distributed computing where a large linear computational job, such as a matrix multiplication, is divided into $k$ smaller tasks, encoded using an $(n,k)$ linear code, and performed over $n$ distributed…
We give a fault tolerant construction for error correction and computation using two punctured quantum Reed-Muller (PQRM) codes. In particular, we consider the $[[127,1,15]]$ self-dual doubly-even code that has transversal Clifford gates…
In this work, doubly extended linearized Reed--Solomon codes and triply extended Reed--Solomon codes are generalized. We obtain a general result in which we characterize when a multiply extended code for a general metric attains the…
We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer code uses CSS-type quantum Reed-Solomon code and the inner code uses a set of special quantum codes. In the field of…
Recently, Bhaintwal and Wasan studied the Generalized Reed-Muller codes over the prime power integer residue ring. In this paper, we give a generalization of these codes to Generalized Reed-Muller codes over Galois rings.
Quantum computers theoretically are able to solve certain problems more quickly than any deterministic or probabilistic computers. A quantum computer exploits the rules of quantum mechanics to speed up computations. However, one has to…
We propose a semiparametric family of copulas based on a set of orthonormal functions and a matrix. This new copula permits to reach values of Spearman's Rho arbitrarily close to one without introducing a singular component. Moreover, it…
In this paper, we introduce the notion of Rota-Baxter Lie $2$-algebras, which is a categorification of Rota-Baxter Lie algebras. We prove that the category of Rota-Baxter Lie $2$-algebras and the category of $2$-term Rota-Baxter…
Solving quadratic equations over finite fields is a fundamental task in algebraic coding theory and serves as a key subroutine for computing the roots of cubic and quartic polynomials. Notably, any quadratic polynomial over binary extension…
MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is…
In this paper, we consider representations of Coxeter groups over a path algebra, R, defined by Dyer. We answer a question posed by Dyer about the multiplicative properties of R, showing that it is "almost a domain". We also show that R cam…
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an…
The Reed-Muller (RM) code encoding $n$-variate degree-$d$ polynomials over ${\mathbb F}_q$ for $d < q$, with its evaluation on ${\mathbb F}_q^n$, has relative distance $1-d/q$ and can be list decoded from a $1-O(\sqrt{d/q})$ fraction of…
In this article, we present a new class of codes known as row-column twisted Reed-Solomon codes (abbreviated as RCTRS), motivated by the works of \cite{beelen2017twisted} and \cite{liu2025column}. We explicitly provide conditions for such…