相关论文: Still better nonlinear codes from modular curves

We extend the approach in [Ann. Statist. 38 (2010) 2499-2524] for identifying locally optimal designs for nonlinear models. Conceptually the extension is relatively simple, but the consequences in terms of applications are profound. As we…

Optimal locally repairable codes with information locality are considered. Optimal codes are constructed, whose length is also order-optimal with respect to a new bound on the code length derived in this paper. The length of the constructed…

This is an overview of recent results aimed at developing a geometry of noncommutative tori with real multiplication, with the purpose of providing a parallel, for real quadratic fields, of the classical theory of elliptic curves with…

In this paper, we study the relationship between algebraic manipulation detection (AMD) codes and highly nonlinear functions. As applications, on one hand, a generic construction for systematic AMD codes is introduced based on highly…

In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…

We present a unifying approach to quantum error correcting code design that encompasses additive (stabilizer) codes, as well as all known examples of nonadditive codes with good parameters. We use this framework to generate new codes with…

The importance of quantum error correction in paving the way to build a practical quantum computer is no longer in doubt. This dissertation makes a threefold contribution to the mathematical theory of quantum error-correcting codes.…

This version improves the old version entitled "On the modularity of elliptic curves with a residually irreducible representation". Let $E$ be an elliptic curve over an abelian totally real field $K$ unramified at 3,5, and 7. We prove that…

In this paper, code decompositions (a.k.a. code nestings) are used to design binary polarization kernels. The proposed kernels are in general non-linear. They provide a better polarization exponent than the previously known kernels of the…

We define a class of automorphisms of rational function fields of finite characteristic and employ these to construct different types of optimal linear rank-metric codes. The first construction is of generalized Gabidulin codes over…

We generalize the notion of cyclic codes by using generator polynomials in (non commutative) skew polynomial rings. Since skew polynomial rings are left and right euclidean, the obtained codes share most properties of cyclic codes. Since…

In this paper a construction of quantum codes from self-orthogonal algebraic geometry codes is provided. Our method is based on the CSS construction as well as on some peculiar properties of the underlying algebraic curves, named Swiss…

In the first part of this article, we consider ruled surfaces defined over a finite field; we introduce invariants for them, and describe some explicit contructions that illustrate possible behaviour of these invariants. In the second part,…

This paper examines linear binary codes capable of correcting one or more errors. For the single-error-correcting case, it is shown that the Hamming bound is achieved by a constructive method, and an exact expression for the minimal…

We treat the problem of completing the moduli space for roots of line bundles on curves. Special attention is devoted to higher spin curves within the universal Picard scheme. Two new different constructions, both using line bundles on…

We generalize the construction of quantum error-correcting codes from GF(4)-linear codes by Calderbank et al. to p^m-state systems. Then we show how to determine the error from a syndrome. Finally we discuss a systematic construction of…

In this paper, locally repairable codes with all-symbol locality are studied. Methods to modify already existing codes are presented. Also, it is shown that with high probability, a random matrix with a few extra columns guaranteeing the…

We construct constant-sized ensembles of linear error-correcting codes over any fixed alphabet that can correct a given fraction of adversarial erasures at rates approaching the Singleton bound arbitrarily closely. We provide several…

In recent years, many useful applications of the polynomial method have emerged in finite geometry. Indeed, algebraic curves, especially those defined by R\'edei-type polynomials, are powerful in studying blocking sets. In this paper, we…

In this paper, we present two new constructions of complex codebooks with multiplicative characters, additive characters and trace functions over finite fields, and determine the maximal cross-correlation amplitude of these codebooks. We…