English
Related papers

Related papers: Complete weight enumerators of two classes of line…

200 papers

We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…

Combinatorics · Mathematics 2018-04-20 Alessio Meneghetti

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

Linear codes with few weights have many applications in secret sharing schemes, authentication codes, communication and strongly regular graphs. In this paper, we consider linear codes with three weights in arbitrary characteristic. To do…

Information Theory · Computer Science 2017-03-27 Sihem Mesnager , Ferruh Özbudak , Ahmet Sınak

The weight hierarchy of a linear code has been an important research topic in coding theory since Wei's original work in 1991. Choosing $ D=\Big\{(x,y)\in \Big(\F_{p^{s_1}}\times\F_{p^{s_2}}\Big)\Big\backslash\{(0,0)\}: f(x)+g(y)=0\Big\}$…

Information Theory · Computer Science 2023-06-14 Xiumei Li , Fei Li

The objective of this paper is to construct a class of linear codes with two nonzero weights and three nonzero weights by using the general trace functions, which weight distributions has been determined. These linear codes contain some…

Information Theory · Computer Science 2016-11-22 Li Liu , Xianhong Xie , Lanqiang Li

Linear codes with few weights have applications in data storage systems, secret sharing schemes, and authentication codes. In this paper, some kinds of p-ary linear codes with few weights are constructed by use of the given de ning set,…

Information Theory · Computer Science 2024-07-16 Mengzhen Zhao , Yanxun Chang

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

Two-weight linear codes are linear codes in which any nonzero codeword can have only two possible distinct weights. Those in the Hamming metric have proven to be very interesting for their connections with authentication codes, association…

Information Theory · Computer Science 2024-05-07 Ferdinando Zullo , Olga Polverino , Paolo Santonastaso , John Sheekey

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

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…

Information Theory · Computer Science 2025-01-22 Zhao Hu , Mingxiu Qiu , Nian Li , Xiaohu Tang , Liwei Wu

We construct two new infinite families of trace codes of dimension $2m$, over the ring $\mathbb{F}_p+u\mathbb{F}_p,$ when $p$ is an odd prime. They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by…

Information Theory · Computer Science 2017-09-18 Minjia Shi , Yue Guan , Patrick Sole

Boolean functions have very nice applications in cryptography and coding theory, which have led to a lot of research focusing on their applications. The objective of this paper is to construct binary linear codes with few weights from the…

Information Theory · Computer Science 2020-06-18 Xiaoqiang Wang , Dabin Zheng , Yan Zhang

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 have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…

Information Theory · Computer Science 2018-11-26 Gaopeng Jian

The generalized Hamming weights of a linear code have been extensively studied since Wei first use them to characterize the cryptography performance of a linear code over the wire-tap channel of type II. In this paper, we investigate the…

Information Theory · Computer Science 2017-02-15 Gaopeng Jian

Perfect codes are arguably the most fascinating structures in combinatorial coding theory, and their classification and weight distribution are of considerable interest. This classification also involves the analysis of some related…

Combinatorics · Mathematics 2026-05-13 Tuvi Etzion , Denis Krotov , Minjia Shi , Wenhao Song

Self-orthogonal codes are an important subclass of linear codes which have nice applications in quantum codes and lattices. It is known that a binary linear code is self-orthogonal if its every codeword has weight divisible by four, and a…

Information Theory · Computer Science 2023-11-21 Xiaoru Li , Ziling Heng

Let $\mathbb{F}_{p^m}$ be the finite field of order $p^m$, where $p$ is an odd prime and $m$ is a positive integer. In this paper, we investigate a class of subfield codes of linear codes and obtain the weight distribution of…

Information Theory · Computer Science 2019-10-15 Xiaoqiang Wang , Dabin Zheng , Yan Zhang

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary…

Information Theory · Computer Science 2016-12-15 Deng Tang , Claude Carlet , Zhengchun Zhou

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