English
Related papers

Related papers: Optimal cyclic codes with generalized Niho type ze…

200 papers

We introduce a definition for \emph{Families of Optimal Binary Non-MDS Erasure Codes} for $[n, k]$ codes over $GF(2)$, and propose an algorithm for finding those families by using hill climbing techniques over Balanced XOR codes. Due to the…

Information Theory · Computer Science 2020-02-14 Danilo Gligoroski , Katina Kralevska

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-03-21 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Solé

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-01-10 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Sole

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

Let $\mathcal{C}$ be a quasi-cyclic code of index $l(l\geq2)$. Let $G$ be the subgroup of the automorphism group of $\mathcal{C}$ generated by $\rho^l$ and the scalar multiplications of $\mathcal{C}$, where $\rho$ denotes the standard…

Information Theory · Computer Science 2023-11-08 Xiaoxiao Li , Minjia Shi , San Ling

Recently, linear codes constructed by defining sets have attracted a lot of study, and many optimal linear codes with a few weights have been produced. The objective of this paper is to present a class of binary linear codes with three…

Information Theory · Computer Science 2016-08-22 Yang Yan , Fei Li , Qiuyan Wang

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…

Information Theory · Computer Science 2016-05-12 Ziling Heng , Qin Yue

We construct a class of linear codes by choosing a proper defining set and determine their complete weight enumerators and weight enumerators. The results show that they are at most three-weight codes and they are suitable for applications…

Information Theory · Computer Science 2019-01-23 Shudi Yang , Xiangli Kong

In this paper, for an even integer $n\geq 4$ and any positive integer $k$ with ${\rm gcd}(n/2,k)={\rm gcd}(n/2-k,2k)=d$ being odd, a class of $p$-ary codes $\mathcal{C}^k$ is defined and their weight distribution is completely determined,…

Information Theory · Computer Science 2008-02-26 Xiangyong Zeng , Nian Li , Lei Hu

Cyclic codes, as a crucial subclass of linear codes, exhibit broad applications in communication systems, data storage systems, and consumer electronics, primarily attributed to their well-structured algebraic properties. Let $p$ denote an…

Information Theory · Computer Science 2025-09-15 Mengen Fang , Lanqiang Li , Fuyin Tian , Li Liu

In this paper, we employ general results on the value distributions of perfect nonlinear functions from $\mathbb{F}_{p^m}$ to $\mathbb{F}_p$ together with a specific group action to give a unified approach to determining the weight…

Information Theory · Computer Science 2023-12-29 Huawei Wu , Jing Yang , Keqin Feng

Recently, some infinite families of minimal and optimal binary linear codes were constructed from simplicial complexes by Hyun {\em et al.} We extend this construction method to arbitrary posets. Especially, anti-chains are corresponded to…

Information Theory · Computer Science 2020-08-18 Jong Yoon Hyun , Hyun Kwang Kim , Yansheng Wu , Qin Yue

Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended…

Information Theory · Computer Science 2022-11-28 Can Xiang , Chunming Tang

Let $n\geq 3$ be a positive integer and let $\mathbb{F}_{q^k}$ be the splitting field of $x^n-1$. By $\gamma$ we denote a primitive element of $\mathbb{F}_{q^k}$. Let $C$ be a cyclic code of length $n$ whose check polynomial contains two…

Combinatorics · Mathematics 2019-03-19 Tai Do Duc

In this paper, a class of two-weight and three-weight linear codes over $\gf(p)$ is constructed, and their application in secret sharing is investigated. Some of the linear codes obtained are optimal in the sense that they meet certain…

Information Theory · Computer Science 2015-03-24 Kelan Ding , Cunsheng Ding

We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…

Information Theory · Computer Science 2025-12-22 Andrea Di Giusto , Elisa Gorla , Alberto Ravagnani

Due to some practical applications, linear complementary dual (LCD) codes and self-orthogonal codes have attracted wide attention in recent years. In this paper, we use simplicial complexes for construction of an infinite family of binary…

Information Theory · Computer Science 2020-03-18 Yansheng Wu , Yoonjin Lee

Linear codes with few weights have applications in authentication codes, secrete sharing schemes, association schemes, consumer electronics and data storage system. In this paper, several classes of linear codes with two or three weights…

Information Theory · Computer Science 2020-07-23 Guangkui Xu , Xiwang Cao

Determining the weight distribution of a linear code is a classical and fundamental topic in coding theory that has been extensively investigated. Repeated-root cyclic codes, which form a significant subclass of error-correcting codes, have…

Information Theory · Computer Science 2025-08-07 Wei Zhao , Weixian Li , Shenghao Yang , Fang-Wei Fu , Kenneth W. Shum