English
Related papers

Related papers: New Classes of $p$-ary Few Weights Codes

200 papers

In this paper, for any odd prime $p$ and an integer $m\ge 3$, several classes of linear codes with $t$-weight $(t=3,5,7)$ are obtained based on some defining sets, and then their complete weight enumerators are determined explicitly by…

Information Theory · Computer Science 2022-08-30 Canze Zhu , Qunying Liao

In this article, we construct linear codes over the commutative non-unital ring $I$ of size four. We obtain their Lee-weight distributions and study their binary Gray images. Under certain mild conditions, these classes of binary codes are…

Information Theory · Computer Science 2023-09-20 Vidya Sagar , Ritumoni Sarma

Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, we determined the complete weight enumerator of two classes of p-ary linear codes constructed from defining set.…

Information Theory · Computer Science 2015-12-24 Qiuyan Wang , Fei Li , Kelan Ding , Dongdai Lin

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we present the explicit complete weight enumerator of a family of $p$-ary linear codes constructed with defining…

Information Theory · Computer Science 2017-07-07 Shudi Yang , Zheng-An Yao

For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…

Information Theory · Computer Science 2016-02-03 Fei Li , Yang Yan , Qiuyan Wang , Tongjiang Yan

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

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

Information Theory · Computer Science 2015-02-23 Bryan Hernandez , Virgilio Sison

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

A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…

Combinatorics · Mathematics 2026-05-20 Hexiang Huang , Haihua Deng , Sihuang Hu

It is known that a linear two-weight code $C$ over a finite field $\F_q$ corresponds both to a multiset in a projective space over $\F_q$ that meets every hyperplane in either $a$ or $b$ points for some integers $a<b$, and to a strongly…

Combinatorics · Mathematics 2007-09-07 E. Byrne , M. Greferath , T. Honold

We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…

Combinatorics · Mathematics 2009-05-11 Eimear Byrne , Marcus Greferath , Axel Kohnert , Vitaly Skachek

In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most…

Information Theory · Computer Science 2022-08-22 Tuan Thanh Nguyen , Kui Cai , Han Mao Kiah , Kees A. Schouhamer Immink , Yeow Meng Chee

Let $R$ be the finite chain ring $\mathbb{F}_{p^{2m}}+{u}\mathbb{F}_{p^{2m}}$, where $\mathbb{F}_{p^{2m}}$ is the finite field with $p^{2m}$ elements, $p$ is a prime, $m$ is a non-negative integer and ${u}^{2}=0.$ In this paper, we firstly…

Information Theory · Computer Science 2024-08-29 Yongsheng Tang , Ting Yao , Heqian Xu , Xiaoshan Kai

Linear codes with a few weights can be applied to communication, consumer electronics and data storage system. In addition, the weight hierarchy of linear codes has many applications such as on the type II wire-tap channel, dealing with…

Information Theory · Computer Science 2021-06-08 Fei Li , Xiumei Li

Because of efficient encoding and decoding algorithms, cyclic codes are an important family of linear block codes, and have applications in communica- tion and storage systems. However, their weight distributions are known only for a few…

Information Theory · Computer Science 2013-02-05 Xiaogang Liu , Yuan Luo

We construct trace codes over $\Z_4$ by using Boolean functions and skew sets, respectively. Their Lee weight distribution is studied by using a Galois ring version of the Walsh-Hadamard transform and exponential sums. We obtain a new…

Information Theory · Computer Science 2017-07-04 Minjia Shi , Yan Liu , Randriam Hugues , Lin Sok , Patrick Sole

In this paper, for an odd prime $p$, by extending Li et al.'s construction \cite{CL2016}, several classes of two-weight and three-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from a defining set, and then their…

Information Theory · Computer Science 2021-07-07 Canze Zhu , Qunying Liao

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring $R_{q}=\mathbb{F}_{2}[u_{1},u_{2},\ldots,u_{q}]/\left\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\right\rangle$ for $q \geq 2$. We also consider the…

Information Theory · Computer Science 2015-06-09 K. Chatouh , K. Guenda , T. A. Gulliver , L. Noui

Coding theory and $t$-designs have close connections and interesting interplay. In this paper, we first introduce a class of ternary linear codes and study their parameters. We then focus on their three-weight subcodes with a special weight…

Information Theory · Computer Science 2019-02-07 Chunming Tang , Cunsheng Ding , Maosheng Xiong

Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of $q$-ary linear codes with two or three weights from vectorial…

Information Theory · Computer Science 2022-07-26 Jiaxin Wang , Zexia Shi , Yadi Wei , Fang-Wei Fu