相关论文: On quadratic residue codes and hyperelliptic curve…
The Graph Burning Problem (GBP) is a combinatorial optimization problem that has gained relevance as a tool for quantifying a graph's vulnerability to contagion. Although it is based on a very simple propagation model, its decision version…
Codes for storage systems aim to minimize the repair locality, which is the number of disks (or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must sustain a high rate, operate on a small finite…
Conformal Prediction (CP) is a popular framework for constructing prediction bands with valid coverage in finite samples, while being free of any distributional assumption. A well-known limitation of conformal prediction is the lack of…
Methods of finding good quantum error correcting codes are discussed, and many example codes are presented. The recipe C_2^{\perp} \subseteq C_1, where C_1 and C_2 are classical codes, is used to obtain codes for up to 16 information qubits…
The strong geodetic problem on a graph $G$ is to determine a smallest set of vertices such that by fixing one shortest path between each pair of its vertices, all vertices of $G$ are covered. To do this as efficiently as possible, strong…
Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable…
Let $p$ be an odd prime and $r,s,m$ be positive integers. In this study, we initiate our exploration by delving into the intricate structure of all repeated-root cyclic codes and their duals with a length of $2^rp^s$ over the finite field…
Motivated from the theory of quantum error correcting codes, we investigate a combinatorial problem that involves a symmetric $n$-vertices colourable graph and a group of operations (colouring rules) on the graph: find the minimum sequence…
Construction of subspace codes with good parameters is one of the most important problems in random network coding. In this paper we present first a generalization of the concept of cyclic subspaces codes and further we show that the usual…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
We study connections between self-inversive and self-reciprocal polynomials, reduction theory of binary forms, minimal models of curves, and formally self-dual codes. We prove that if $\mathcal X$ is a superelliptic curve defined over…
In this paper, we study residues of differential 2-forms on a smooth algebraic surface over an arbitrary field and give several statements about sums of residues. Afterwards, using these results we construct algebraic-geometric codes which…
In this paper, we propose several constructions of Locally Recoverable Codes from elliptic surfaces. In particular, we are able to obtain codes with availability $t>2$, codes with hierarchical locality and, finally, codes which combine…
In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] (arXiv:1701.05583) developed a general theory of channel duality for classical-input quantum-output (CQ) channels. That result showed that a number of well-known…
Designing quantum error correcting codes that promise a high error threshold, low resource overhead and efficient decoding algorithms is crucial to achieve large-scale fault-tolerant quantum computation. The concatenated quantum Hamming…
We investigate various aspects of operator quantum error-correcting codes or, as we prefer to call them, subsystem codes. We give various methods to derive subsystem codes from classical codes. We give a proof for the existence of subsystem…
We develop a new family of linear programs, that yield upper bounds on the rate of binary linear codes of a given distance. Our bounds apply {\em only to linear codes.} Delsarte's LP is the weakest member of this family and our LP yields…
Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…
Topological quantum error correction codes are known to be able to tolerate arbitrary local errors given sufficient qubits. This includes correlated errors involving many local qubits. In this work, we quantify this level of tolerance,…
Elliptic curves have a well-known and explicit theory for the construction and application of endomorphisms, which can be applied to improve performance in scalar multiplication. Recent work has extended these techniques to hyperelliptic…