相关论文: On linear codes with one-dimensional Euclidean hul…
In this paper, we provide a framework for constructing entanglement-assisted quantum error-correcting codes (EAQECCs) from classical additive codes over a finite commutative local Frobenius ring $\mathcal{R}$. At the heart of the framework,…
Entanglement-assisted quantum error-correcting (EAQEC) codes make use of preexisting entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQEC code from any classical linear code,…
The theory of entanglement-assisted quantum error-correcting codes (EAQECCs) is a generalization of the standard stabilizer quantum error-correcting codes, which can be possibly constructed from any classical codes by relaxing the duality…
Hyperdimensional Computing (HDC) is an emerging computational paradigm for representing compositional information as high-dimensional vectors, and has a promising potential in applications ranging from machine learning to neuromorphic…
We introduce a framework for entanglement-assisted quantum error correcting codes that unifies the three original frameworks for such codes called EAQEC, EAOQEC, and EACQ under a single umbrella. The unification is arrived at by viewing…
Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…
Shape recognition and classification is a problem with a wide variety of applications. Several recent works have demonstrated that topological descriptors can be used as summaries of shapes and utilized to compute distances. In this…
Topological quantum error-correcting codes (QECC) encode a variety of topological invariants in their code space. A classic structure that has not been encoded directly is that of obstruction classes of a fiber bundle, such as the Chern or…
Finding a mass formula for a given class of linear codes is a fundamental problem in combinatorics and coding theory. In this paper, we consider the action of the unitary (resp. symplectic) group on the set of all Hermitian (resp.…
In the recent years, there has been active research on self-orthogonal embeddings of linear codes since they yielded some optimal self-orthogonal codes. LCD codes have a trivial hull so they are counterparts of self-orthogonal codes. So it…
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of convex hulls that are required for polyhedral analysis to be…
Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the graph-cover pseudocodewords. The latter pseudocodewords, when…
Linear codes with complementary duals (abbreviated LCD) are linear codes whose intersection with their dual are trivial. When they are binary, they play an important role in armoring implementations against side-channel attacks and fault…
Entanglement-assisted quantum error-correcting codes (EAQECCs) make use of pre-existing entanglement between the sender and receiver to boost the rate of transmission. It is possible to construct an EAQECC from any classical linear code,…
In this paper, we investigate an artificial-intelligence (AI) driven approach to design error correction codes (ECC). Classic error correction code was designed upon coding theory that typically defines code properties (e.g., hamming…
We study the Hermitian hull-variation problem for vector rank-metric codes. Except for one parameter pair, we show that the Hermitian hull dimension of such a code can be reduced to any smaller value within its equivalence class, and in…
The square $C^{*2}$ of a linear error correcting code $C$ is the linear code spanned by the component-wise products of every pair of (non-necessarily distinct) words in $C$. Squares of codes have gained attention for several applications…
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…
We show that any ternary Euclidean (resp.\ quaternary Hermitian) linear complementary dual $[n,k]$ code contains a Euclidean (resp.\ Hermitian) linear complementary dual $[n,k-1]$ subcode for $2 \le k \le n$. As a consequence, we derive a…
Quantum error correction (QEC) is essential for building scalable quantum computers, but a lack of systematic, end-to-end evaluation methods makes it difficult to assess how different QEC codes perform under realistic conditions. The vast…