English
Related papers

Related papers: A Short Note on Self-Duality of Goppa Codes on Ell…

200 papers

We describe topological gauge theories for which duality properties are encoded by construction. We study them for compact manifolds of dimensions four, eight and two. The fields and their duals are treated symmetrically, within the context…

High Energy Physics - Theory · Physics 2009-10-31 L Baulieu , S. L. Shatashvili

In this paper we study evaluation codes arising from plane quotients of the Hermitian curve, defined by affine equations of the form $y^q+y=x^m$, $q$ being a prime power and $m$ a positive integer which divides $q+1$. The dual minimum…

Algebraic Geometry · Mathematics 2013-09-04 Edoardo Ballico , Alberto Ravagnani

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.…

Information Theory · Computer Science 2019-11-26 Lin Sok

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…

Information Theory · Computer Science 2012-10-09 Yun Fan , Guanghui Zhang

The purpose of this paper is to propose an efficient method to compute the automorphism group of an arbitrary hyperelliptic function field (genus>1) over a given ground field of characteristic >2 as well as over its algebraic extensions.

Number Theory · Mathematics 2007-05-23 Norbert Goeb

Hoholdt, van Lint and Pellikaan used order functions to construct codes by means of Linear Algebra and Semigroup Theory only. However, Geometric Goppa codes that can be represented by this method are mainly those based on just one point. In…

Information Theory · Computer Science 2007-07-13 C. Carvalho , C. Munuera , E. Silva , F. Torres

In this first part of the paper, we define a natural dual object for manifolds with corners and show how pseudodifferential calculus on such manifolds can be constructed in terms of the localization principle in C*-algebras. In the second…

Operator Algebras · Mathematics 2007-05-23 V. E. Nazaikinskii , A. Yu. Savin , B. Yu. Sternin

We briefly review the structure and properties of self-dual field actions.

High Energy Physics - Theory · Physics 2007-05-23 Dmitri Sorokin

In this paper, we introduce multivariate Goppa codes, which contain as a special case the well-known, classical Goppa codes. We provide a parity check matrix for a multivariate Goppa code in terms of a tensor product of generalized…

Information Theory · Computer Science 2024-02-07 Hiram H. López , Gretchen L. Matthews

The interpolation-based decoding that was developed for general evaluation AG codes is shown to be equally applicable to general differential AG codes. A performance analysis of the decoding algorithm, which is parallel to that of its…

Information Theory · Computer Science 2014-07-23 Kwankyu Lee

The Goppa Code Distinguishing (GD) problem asks to distinguish efficiently a generator matrix of a Goppa code from a randomly drawn one. We revisit a distinguisher for alternant and Goppa codes through a new approach, namely by studying the…

Information Theory · Computer Science 2021-11-29 Rocco Mora , Jean-Pierre Tillich

We define a new class of Convolutional Codes in terms of fibrations of algebraic varieties generalizaing our previous constructions of Convolutional Goppa Codes. Using this general construction we can give several examples of Maximum…

Information Theory · Computer Science 2010-12-23 J. I. Iglesias Curto , J. M. Muñoz Porras , F. J. Plaza Martín , G Serrano Sotelo

MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual…

Information Theory · Computer Science 2019-11-14 Aixian Zhang , Keqin Feng

We give a general method to construct MDS one-dimensional convolutional codes. Our method generalizes previous constructions of H. Gluesing-Luerssen and B. Langfeld. Moreover we give a classification of one-dimensional Convolutional Goppa…

Information Theory · Computer Science 2011-07-12 J. A. Domínguez Pérez , J. M. Muñoz Porras , G. Serrano Sotelo

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…

Information Theory · Computer Science 2021-02-22 Whan-Hyuk Choi , Jon-Lark Kim

We characterize the structure of 2-quasi-cyclic codes over a finite field F by the so-called Goursat Lemma. With the characterization, we exhibit a necessary and sufficient condition for a 2-quasi-cyclic code being a dihedral code. And we…

Information Theory · Computer Science 2022-01-06 Yun Fan , Yuchang Zhang

This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic $p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we give…

Information Theory · Computer Science 2018-01-23 Minjia Shi , Daitao Huang , Lin Sok , Patrick Solé

Let $A=\frac{\mathbb{F}[x]}{\langle f(x)\rangle }$, where $f(x)$ is a monic polynomial over a finite field $\mathbb{F}$. In this paper, we study the relation between $A$-codes and their duals. In particular, we state a counterexample and a…

Information Theory · Computer Science 2017-05-30 Ashkan Nikseresht

In this note, we give a construction of codes on algebraic function field $F/ \mathbb{F}_{q}$ using places of $F$ (not necessarily of degree one) and trace functions from various extensions of $\mathbb{F}_{q}$. This is a generalization of…

Information Theory · Computer Science 2021-04-15 Nupur Patanker , Sanjay Kumar Singh

We consider generalizations of Reed-Muller codes, toric codes, and codes from certain plane curves, such as those defined by norm and trace functions on finite fields. In each case we are interested in codes defined by evaluating arbitrary…

Information Theory · Computer Science 2007-07-16 Maria Bras-Amorós , Michael E. O'Sullivan