English
Related papers

Related papers: Optimal three-weight cyclic codes whose duals are …

200 papers

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

The generalized Hamming weight of linear codes is a natural generalization of the minimum Hamming distance. They convey the structural information of a linear code and determine its performance in various applications, and have become one…

Information Theory · Computer Science 2022-12-08 Chao Liu , Dabin Zheng , Xiaoqiang Wang

Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been…

Information Theory · Computer Science 2022-07-18 Xiaoqiang Wang , Chunming Tang , Cunsheng Ding

By exploiting the connection between scattered $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^3$ and minimal non degenerate $3$-dimensional rank metric codes of $\mathbb{F}_{q^m}^{n}$, $n \geq m+2$, described in [2], we will exhibit a new…

Information Theory · Computer Science 2024-02-13 Stefano Lia , Giovanni Longobardi , Giuseppe Marino , Rocco Trombetti

Based on a sufficient condition proposed by Hollmann and Xiang for constructing triple-error-correcting codes, the minimum distance of a binary cyclic code $\mathcal{C}_{1,3,13}$ with three zeros $\alpha$, $\alpha^3$, and $\alpha^{13}$ of…

Discrete Mathematics · Computer Science 2010-04-01 Xiangyong Zeng , Jinyong Shan , Lei Hu

Recently, subfiled codes of linear code over GF$ (q) $ with good parameters were studied, and many optimal subfield codes were obtained. In this paper, Our mainly motivation is to generlize the results of the subfield codes of hyperoval in…

Information Theory · Computer Science 2022-11-02 Xiaoqiong Ran , Rong Luo

Generalized Bicycle (GB) codes offer a compelling alternative to surface codes for quantum error correction. This paper focuses on (2,2)-Generalized Bicycle codes, constructed from pairs of binary circulant matrices with two non-zero…

Information Theory · Computer Science 2025-07-30 François Arnault , Philippe Gaborit , Nicolas Saussay

Let $q=2^n$, $0\leq k\leq n-1$, $n/\gcd(n,k)$ be odd and $k\neq n/3, 2n/3$. In this paper the value distribution of following exponential sums \[\sum\limits_{x\in \bF_q}(-1)^{\mathrm{Tr}_1^n(\alpha x^{2^{2k}+1}+\beta x^{2^k+1}+\ga…

Information Theory · Computer Science 2009-04-16 Jinquan Luo

The cyclic code is a subclass of linear codes and has applications in consumer electronics, data storage systems and communication systems due to the efficient encoding and decoding algorithms. In 2013, Ding, et al. presented nine open…

Information Theory · Computer Science 2025-06-12 Dong He , Peipei Zheng , Qunying Liao

Let $G_{(m,3,r)}=\langle x,y\mid x^m=1, y^3=1,yx=x^ry\rangle$ be a metacyclic group of order $3m$, where ${\rm gcd}(m,r)=1$, $1<r<m$ and $r^3\equiv 1$ (mod $m$). Then left ideals of the group algebra $\mathbb{F}_q[G_{(m,3,r)}]$ are called…

Information Theory · Computer Science 2016-06-17 Cao Yonglin , Cao Yuan , Fu Fang-Wei , Gao Jian

A new method of constructing optimum constant weight codes over F_2 based on a generalized $(u, u+v)$ construction is presented. We present a new method of constructing superimposed code $C_{(s_1,s_2,\cdots,s_I)}^{(h_1, h_2, \cdots, h_I)}$…

Information Theory · Computer Science 2014-06-24 Masao Kasahara , Shigeichi Hirasawa

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$…

Information Theory · Computer Science 2019-10-11 Yansheng Wu , Xiaomeng Zhu , Qin Yue

Usually, it is difficult to determine the weight distribution of an irreducible cyclic code. In this paper, we discuss the case when an irreducible cyclic code has the maximal number of distinct nonzero weights and give a necessary and…

Information Theory · Computer Science 2012-05-08 Chunming Tang , Yanfeng Qi , Maozhi Xu , Baocheng Wang , Yixian Yang

As a generalization of cyclic codes, quasi-cyclic (QC) codes contain many good linear codes. But quasi-cyclic codes studied so far are mainly limited to one generator (1-generator) QC codes. In this correspondence, 2-generator and…

Information Theory · Computer Science 2007-07-16 Eric Zhi Chen

Cyclic codes are an interesting family of linear codes since they have efficient decoding algorithms and contain optimal codes as subfamilies. Constructing infinite families of cyclic codes with good parameters is important in both theory…

Information Theory · Computer Science 2023-11-01 Zhonghua Sun , Ling Li , Shixin Zhu

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

Due to the wide applications in consumer electronics, data storage systems and communication systems, cyclic codes have been an interesting research topic in coding theory. In this paper, let $p$ be a prime with $p\ge 7$. We determine the…

Information Theory · Computer Science 2019-11-21 Xia Li , Qin Yue

In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…

Information Theory · Computer Science 2022-01-03 Yansheng Wu , Chengju Li , Fu Xiao

Recently, subfield codes of geometric codes over large finite fields $\gf(q)$ with dimension $3$ and $4$ were studied and distance-optimal subfield codes over $\gf(p)$ were obtained, where $q=p^m$. The key idea for obtaining very good…

Information Theory · Computer Science 2020-08-11 Ziling Heng , Cunsheng Ding

The task of constructing infinite families of self-dual codes with unbounded lengths and minimum distances exhibiting square-root lower bounds is extremely challenging, especially when it comes to cyclic codes. Recently, the first infinite…

Information Theory · Computer Science 2025-04-17 Xiaoqiang Wang , Liuyi Li , Yansheng Wu , Dabin Zheng , Shuxian Lu