相关论文: On quadratic residue codes and hyperelliptic curve…

We introduce several new methods to obtain upper bounds on the number of solutions of the congruences $f(x) \equiv y \pmod p$ and $f(x) \equiv y^2 \pmod p,$ with a prime $p$ and a polynomial $f$, where $(x,y)$ belongs to an arbitrary square…

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

High-rate quantum error correcting codes mitigate the imposing scale of fault-tolerant quantum computers but require efficient generation of non-local, many-body entanglement. We provide a linear-optical architecture with these properties,…

Let $\X$ be an algebraic curve of genus $g \geq 2$ defined over a field $\F_q$ of characteristic $p > 0$. From $\X$, under certain conditions, we can construct an algebraic geometry code $C$. If the code $C$ is self-orthogonal under the…

The theory of algebraic-geometric codes has been developed in the beginning of the 80's after a paper of V.D. Goppa. Given a smooth projective algebraic curve X over a finite field, there are two different constructions of error-correcting…

Error-correcting codes over the real field are studied which can locate outlying computational errors when performing approximate computing of real vector--matrix multiplication on resistive crossbars. Prior work has concentrated on…

The existence of $q$-ary linear complementary pairs (LCPs) of codes with $q> 2$ has been completely characterized so far. This paper gives a characterization for the existence of binary LCPs of codes. As a result, we solve an open problem…

Spatially-coupled (SC) codes are a family of graph-based codes that have attracted significant attention thanks to their capacity approaching performance and low decoding latency. An SC code is constructed by partitioning an underlying…

We study hyperelliptic curves y^2=f(x) over local fields of odd residue characteristic. We introduce the notion of a "cluster picture" associated to the curve, that describes the p-adic distances between the roots of f(x), and show that…

We apply classical invariant theory of binary forms to explicitly characterize isomorphism classes of hyperelliptic curves of small genus and, conversely, propose algorithms for reconstructing hyperelliptic models from given invariants. We…

Let C/Q be a curve of genus three, given as a double cover of a plane conic. Such a curve is hyperelliptic over the algebraic closure of Q, but may not have a hyperelliptic model of the usual form over Q. We describe an algorithm that…

A generic construction of linear codes over finite fields has recently received a lot of attention, and many one-weight, two-weight and three-weight codes with good error correcting capability have been produced with this generic approach.…

In this paper, we show that there exist families of curves (defined over an algebraically closed field $k$ of characteristic $p >2$) whose Jacobians have interesting $p$-torsion. For example, for every $0 \leq f \leq g$, we find the…

Subspace codes have received an increasing interest recently due to their application in error-correction for random network coding. In particular, cyclic subspace codes are possible candidates for large codes with efficient encoding and…

One of the main objectives of quantum error-correction theory is to construct quantum codes with optimal parameters and properties. In this paper, we propose a class of 2-generator quasi-cyclic codes and study their applications in the…

We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness…

Error-correction codes are central for fault-tolerant information processing. Here we develop a rigorous framework to describe various coding models based on quantum resource theory of superchannels. We find, by treating codings as…

Consider an assignment of bits to the vertices of a connected graph $G(V,E)$ with the property that the value of each vertex is a function of the values of its neighbors. A collection of such assignments is called a {\em storage code} of…

In the modern era of large-scale computing systems, a crucial use of error correcting codes is to judiciously introduce redundancy to ensure recoverability from failure. To get the most out of every byte, practitioners and theorists have…

We address the problems of constructing quantum convolutional codes (QCCs) and of encoding them. The first construction is a CSS-type construction which allows us to find QCCs of rate 2/4. The second construction yields a quantum…