English
Related papers

Related papers: A Class of Linear Codes With Three Weights

200 papers

We study the combinatorial function $L(k,q),$ the maximum number of nonzero weights a linear code of dimension $k$ over $\F_q$ can have. We determine it completely for $q=2,$ and for $k=2,$ and provide upper and lower bounds in the general…

Information Theory · Computer Science 2018-04-26 Minjia Shi , Hongwei Zhu , Patrick Solé , Gérard D. Cohen

Linear codes generated by component functions of perfect nonlinear (PN) and almost perfect nonlinear (APN) functions and the first-order Reed-Muller codes have been an object of intensive study in coding theory. The objective of this paper…

Information Theory · Computer Science 2020-09-02 Can Xiang , Chunming Tang , Cunsheng Ding

Let $p$ be an odd prime number. In this paper, we construct $2(2p-3)$ classes of codes over the ring $R=\Bbb F_p+u\Bbb F_p,u^2=0$, which are associated with down sets. We compute the Lee weight distributions of the $2(2p-3)$ classes of…

Information Theory · Computer Science 2020-01-22 Yansheng Wu , Jong Yoon Hyun

Recently, constructions of optimal linear codes from simplicial complexes have attracted much attention and some related nice works were presented. Let $q$ be a prime power. In this paper, by using the simplicial complexes of ${\mathbb…

Information Theory · Computer Science 2024-07-16 Bing Chen , Yunge Xu , Zhao Hu , Nian Li , Xiangyong Zeng

Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…

Information Theory · Computer Science 2024-01-08 Ziling Heng , Xiaoru Li , Yansheng Wu , Qi Wang

For an odd prime $p$ and two positive integers $n\geq 3$ and $k$ with $\frac{n}{{\rm gcd}(n,k)}$ being odd, the paper determines the weight distribution of a $p$-ary cyclic code $\mathcal{C}$ over $\mathbb{F}_{p}$ with nonzeros…

Information Theory · Computer Science 2009-01-19 Xiangyong Zeng , Lei Hu , Wenfeng Jiang , Qin Yue , Xiwang Cao

As a subclass of linear codes, cyclic codes have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, five families of three-weight…

Information Theory · Computer Science 2013-08-27 Cunsheng Ding , Ying Gao , Zhengchun Zhou

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

Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…

Information Theory · Computer Science 2024-11-08 Peng Wang , Ziling Heng

Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…

Quantum Physics · Physics 2026-01-28 Fuchuan Wei , Zhengyi Han , Austin Yubo He , Zimu Li , Zi-Wen Liu

In this paper, based on the theory of defining sets, a class of four-weight or five-weight linear codes over Fp is constructed. The complete weight enumerators of the linear codes are determined by means of Weil sums. In some case, there is…

Information Theory · Computer Science 2020-12-10 Xina Zhang

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

Cyclic codes are an important class of linear codes, whose weight distribution have been extensively studied. Most previous results obtained so far were for cyclic codes with no more than three zeroes. Inspired by the works…

Information Theory · Computer Science 2018-06-21 Maosheng Xiong , Nian Li , Zhengchun Zhou , Cunsheng Ding

In this article, we present two new approaches to construct minimal linear codes of dimension $n+1$ over $\mathbb{F}_{3}$ using characteristic and ternary functions. We also obtain the weight distributions of these constructed minimal…

Information Theory · Computer Science 2024-05-24 Wajid M. Shaikh , Rupali S. Jain , B. Surendranath Reddy , Bhagyashri S. Patil , Sahar M. A. Maqbol

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

In this article we mainly study linear codes over $\mathbb{F}_{2^n}$ and their binary subfield codes. We construct linear codes over $\mathbb{F}_{2^n}$ whose defining sets are the certain subsets of $\mathbb{F}_{2^n}^m$ obtained from…

Information Theory · Computer Science 2023-03-17 Hongwei Liu , Zihao Yu

Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Mengjie Yang , Yang Ming

Linear codes have attracted considerable attention in coding theory and cryptography due to their significant applications in secret sharing schemes, secure two-party computation, Galois geometries, among others. As two special subclasses…

Information Theory · Computer Science 2025-07-15 Wengang Jin , Kangquan Li , Longjiang Qu

We study trace codes with defining set $L,$ a subgroup of the multiplicative group of an extension of degree $m$ of the alphabet ring $\mathbb{F}_3+u\mathbb{F}_3+u^{2}\mathbb{F}_{3},$ with $u^{3}=1.$ These codes are abelian, and their…

Information Theory · Computer Science 2016-12-06 Minjia Shi , Daitao Huang , Patrick Sole

Two general constructions of linear codes with functions over finite fields have been extensively studied in the literature. The first one is given by $\mathcal{C}(f)=\left\{ {\rm Tr}(af(x)+bx)_{x \in \mathbb{F}_{q^m}^*}: a,b \in…

Information Theory · Computer Science 2021-01-22 Xiaoqiang Wang , Dabin Zheng , Cunsheng Ding
‹ Prev 1 4 5 6 7 8 10 Next ›