相关论文: Still better nonlinear codes from modular curves
Elliptic curves over finite fields with predefined conditions in the order are practically constructed using the theory of complex multiplication. The stage with longest calculations in this method reconstructs some polynomial with integer…
The minimum distance graph of a code has the codewords as vertices and edges exactly when the Hamming distance between two codewords equals the minimum distance of the code. A constructive proof for reconstructibility of an extended perfect…
Algebraic-geometric codes can be constructed by evaluating a certain set of functions on a set of distinct rational points of an algebraic curve. The set of functions that are evaluated is the linear space of a given divisor or,…
We present a new application of multi-orbit cyclic subspace codes to construct large optical orthogonal codes, with the aid of the multiplicative structure of finite fields extensions. This approach is different from earlier approaches…
We prove that many representations $\overline{\rho} : \operatorname{Gal}(\overline{K} / K) \to \operatorname{GL}_2(\mathbb{F}_3)$, where $K$ is a CM field, arise from modular elliptic curves. We prove similar results when the prime $p = 3$…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear…
We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such…
These are the substantially expanded notes of the lectures of JK at the summer school "Higher-Dimensional Geometry over Finite Fields" in G\"ottingen, June 2007. The first part gives an overview of the methods. The main new result is the…
Several new constructions of 3-dimensional optical orthogonal codes are presented here. In each case the codes have ideal autocorrelation $\mathbf{ \lambda_a=0} $, and in all but one case a cross correlation of $ \mathbf{\lambda_c=1} $. All…
Series of maximum distance quantum error-correcting codes are developed and analysed. For a given rate and given error-correction capability, quantum error-correcting codes with these specifications are constructed. The codes are explicit…
A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…
We give an account of Mazur's proof that, for an elliptic curve over $\mathbb{Q}$, if it admits a nonconstant mapping from $X(N)$ defined over the complex numbers $\mathbb{C}$, for some $N$, then it also admits a nonconstant mapping from…
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…
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…
We establish asymptotic formulas for counting rational points near finite type curves on the plane, generalizing Huang's result.
Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…
The Knill-Laflamme (KL) conditions distinguish exact quantum error correction codes, and it has played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not…
Let $\mathbb{F}_q$ denote the finite field with $q$ elements. In this work, we use characters to give the number of rational points on suitable curves of low degree over $\mathbb{F}_q$ in terms of the number of rational points on elliptic…
We determine conditions that guarantee that a hyperelliptic or plane curve over a field of characteristic not equal to 2 can be defined over its field of moduli. We also give new examples of curves not definable over their fields of moduli.