35 research outputs found
Reed-Solomon list decoding from a system-theoretic perspective
In this paper, the Sudan-Guruswami approach to list decoding of Reed-Solomon (RS) codes is cast in a system-theoretic framework. With the data, a set of trajectories or time series is associated which is then modeled as a so-called behavior. In this way, a connection is made with the behavioral approach to system theory. It is shown how a polynomial representation of the modeling behavior gives rise to the bivariate interpolating polynomials of the Sudan-Guruswami approach. The concept of "weighted row reduced" is introduced and used to achieve minimality. Two decoding methods are derived and a parametrization of all bivariate interpolating polynomials is given
New linear codes over Zps via the trace map
The trace map has been used very successfully to generate cocyclic complex and Butson Hadamard matrices and simplex codes over Z4 and Z2s. We extend this technique to obtain new linear codes over Zps. It is worth nothing here that these codes are cocyclic but not simplex codes. Further we find that the construction method also gives Butson Hadamard matrices of order psm
Systems theoretic methods in decoding
In this paper we show how ideas based on system theoretic modeling of linear behaviors may be used for decoding of linear codes. In particular we show how Sudan's bivariate interpolation approach to list decoding of RS codes allows a system theoretic interpretation
Generalization of the Lee-O'Sullivan List Decoding for One-Point AG Codes
We generalize the list decoding algorithm for Hermitian codes proposed by Lee
and O'Sullivan based on Gr\"obner bases to general one-point AG codes, under an
assumption weaker than one used by Beelen and Brander. Our generalization
enables us to apply the fast algorithm to compute a Gr\"obner basis of a module
proposed by Lee and O'Sullivan, which was not possible in another
generalization by Lax.Comment: article.cls, 14 pages, no figure. The order of authors was changed.
To appear in Journal of Symbolic Computation. This is an extended journal
paper version of our earlier conference paper arXiv:1201.624
On Steane-Enlargement of Quantum Codes from Cartesian Product Point Sets
In this work, we study quantum error-correcting codes obtained by using
Steane-enlargement. We apply this technique to certain codes defined from
Cartesian products previously considered by Galindo et al. in [4]. We give
bounds on the dimension increase obtained via enlargement, and additionally
give an algorithm to compute the true increase. A number of examples of codes
are provided, and their parameters are compared to relevant codes in the
literature, which shows that the parameters of the enlarged codes are
advantageous. Furthermore, comparison with the Gilbert-Varshamov bound for
stabilizer quantum codes shows that several of the enlarged codes match or
exceed the parameters promised by the bound.Comment: 12 page
On the invariants of the quotients of the Jacobian of a curve of genus 2
The original publication is available at www.springerlink.comInternational audienceLet C be a curve of genus 2 that admits a non-hyperelliptic involution. We show that there are at most 2 isomorphism classes of elliptic curves that are quotients of degree 2 of the Jacobian of C. Our proof is constructive, and we present explicit formulae, classified according to the involutions of C, that give the minimal polynomial of the j-invariant of these curves in terms of the moduli of C. The coefficients of these minimal polynomials are given as rational functions of the moduli
Distribution of trace values and two-weight, self-orthogonal codes over GF (p,2)
The uniform distribution of the trace map lends itself very well to the construction of binary and non-binary codes from Galois fields and Galois rings. In this paper we study the distribution of the trace map with the argument ax 2 over the Galois field GF(p,2). We then use this distribution to construct two-weight, self-orthogonal, trace codes
代数的符号理論.組合せデザイン理論とアソシエーション・スキームの研究
平成12年度-平成15年度科学研究費補助金(基盤研究(B)(2))研究成果報告書,課題番号.1244003
Algebraic lower bounds on the free distance of convolutional codes
A new module structure for convolutional codes is introduced and used to establish further links with quasi-cyclic and cyclic codes. The set of finite weight codewords of an (n,k) convolutional code over Fq is shown to be isomorphic to an Fq[x]-submodule of Fq n[x], where Fq n[x] is the ring of polynomials in indeterminate x over Fq n, an extension field of Fq. Such a module can then be associated with a quasi-cyclic code of index n and block length nL viewed as an Fq[x]-submodule of Fq n[x]/langxL-1rang, for any positive integer L. Using this new module approach algebraic lower bounds on the free distance of a convolutional code are derived which can be read directly from the choice of polynomial generators. Links between convolutional codes and cyclic codes over the field extension Fq n are also developed and Bose-Chaudhuri-Hocquenghem (BCH)-type results are easily established in this setting. Techniques to find the optimal choice of the parameter L are outline
Cocyclic butson Hadamard matrices and codes over Zn via the trace map
Over the past couple of years, trace maps over Galois fields and Galois rings have been used very succesfully o construct cocyclic Hadamard, complex Hadamard and Butson Hadamard matrices and subsequently to generate simplex codes over Z4, Z2 and ZP and new linear codes over ZP. Here we define a new map, the trace-like map and more generally the weighted map and extend these techniques to construct cocyclic Budson Hadamard matrices of order (nm) for all n and m and linear and non-linear codes over Zn