English
Related papers

Related papers: Weights in Codes and Genus 2 Curves

200 papers

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-30 Thomas Honold

In this paper, constructions of some double circulant self-dual codes by generalized cyclotomic classes of order two are presented. This technique is applied to [72, 36, 12] binary highest know self-dual codes to obtain self-dual codes over…

Information Theory · Computer Science 2019-12-16 Wenpeng Gao , Tongjiang Yan

In this paper, we apply two-to-one functions over $\mathbb{F}_{2^n}$ in two generic constructions of binary linear codes. We consider two-to-one functions in two forms: (1) generalized quadratic functions; and (2) $\left(x^{2^t}+x\right)^e$…

Information Theory · Computer Science 2020-06-23 Kangquan Li , Chunlei Li , Tor Helleseth , Longjiang Qu

In this paper, we make some progress towards a well-known conjecture on the minimum weights of binary cyclic codes with two primitive nonzeros. We also determine the Walsh spectrum of $\Tr(x^d)$ over $\F_{2^{m}}$ in the case where $m=2t$,…

Information Theory · Computer Science 2015-06-12 Tao Feng , Ka Hin Leung , Qing Xiang

Linear codes have been an interesting subject of study for many years, as linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, a class of…

Information Theory · Computer Science 2016-01-27 Can Xiang , Chunming Tang , Keqin Feng

Linear codes with few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of…

Information Theory · Computer Science 2015-08-17 Chunming Tang , Nian Li , Yanfeng Qi , Zhengchun Zhou , Tor Helleseth

Linear codes with large minimal distances are important error correcting codes in information theory.Orthogonal codes have more applications in the other fields of mathematics. In this paper, we study the binary and ternary orthogonal codes…

Representation Theory · Mathematics 2009-03-17 Xiaoping Xu

In this paper, a family of five-weight reducible cyclic codes is presented. Furthermore, the weight distribution of these cyclic codes is determined, which follows from the determination of value distributions of certain exponential sums.

Information Theory · Computer Science 2015-02-13 Yan Liu , Haode Yan

In this paper, we investigate two-point Algebraic Geometry codes associated to the Skabelund maximal curve constructed as a cyclic cover of the Suzuki curve. In order to estimate the minimum distance of such codes, we make use of the…

Algebraic Geometry · Mathematics 2024-01-17 Leonardo Landi , Marco Timpanella , Lara Vicino

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight…

Information Theory · Computer Science 2013-06-25 Chengju Li , Qin Yue

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in…

Information Theory · Computer Science 2023-01-18 Hai Liu , Chengju Li , Cunsheng Ding

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, a class of three-weight…

Information Theory · Computer Science 2013-02-05 Zhengchun Zhou , Cunsheng Ding

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

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

Combinatorics · Mathematics 2019-04-10 Xiaoni Du , Rong Wang , Cuiling Fan

We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…

Information Theory · Computer Science 2020-12-02 P. G. Boyvalenkov , K. V. Delchev , D. V. Zinoviev , V. A. Zinoviev

It is well known that the problem of determining the weight distributions of families of cyclic codes is, in general, notoriously difficult. An even harder problem is to find characterizations of families of cyclic codes in terms of their…

Information Theory · Computer Science 2015-08-21 Gerardo Vega

In this paper, the cyclic codes of length $n$, where $n$ is odd with certain restrictions, over a finite chain ring $R$, have been studied using the structure of group algebra approach. The primitive idempotents of $RG$ of a finite cyclic…

Rings and Algebras · Mathematics 2025-09-22 Seema Antil , Gurleen Kaur , Manju Khan

We give necessary conditions for a two-weight projective cyclic code to be the direct sum of two one-weight irreducible cyclic subcodes of the same dimension, following the work of Wolfmann and Vega. This confirms Vega's conjecture that all…

Information Theory · Computer Science 2012-11-15 Tao Feng

Cyclic codes have been widely used in digital communication systems and consume electronics as they have efficient encoding and decoding algorithms. The weight distribution of cyclic codes has been an important topic of study for many…

Information Theory · Computer Science 2013-01-15 Jing Yang , Maosheng Xiong , Cunsheng Ding

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

Information Theory · Computer Science 2017-12-05 Hongwei Liu , Youcef Maouche