English
Related papers

Related papers: Linear Codes with Two or Three Weights From Quadra…

200 papers

Combinatorial $t$-designs have wide applications in coding theory, cryptography, communications and statistics. It is well known that the supports of all codewords with a fixed weight in a code may give a $t$-design. In this paper, we first…

Combinatorics · Mathematics 2019-04-10 Xiaoni Du , Rong Wang , Cuiling Fan

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 paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…

Rings and Algebras · Mathematics 2024-09-01 Rupali S. Jain , B. Surendranath Reddy , Wajid M. Shaikh

We study the functional codes $C_2(X)$ defined on projective varieties $X$, in the case where $X\subset \mathbb{P}^3$ is a 1-degenerate quadric or a non-degenerate quadric (hyperbolic or elliptic). We find the minimum distance of these…

Algebraic Geometry · Mathematics 2007-05-23 Frederic A. B. Edoukou

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we use the method developed before to solve one more special case. We make extensive use of standard…

Number Theory · Mathematics 2012-10-17 Maosheng Xiong

The determination of weight distribution of cyclic codes involves evaluation of Gauss sums and exponential sums. Despite of some cases where a neat expression is available, the computation is generally rather complicated. In this note, we…

Information Theory · Computer Science 2017-03-21 Shuxing Li , Sihuang Hu , Tao Feng , Gennian Ge

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

One-weight codes, in which all nonzero codewords share the same weight, form a highly structured class of linear codes with deep connections to finite geometry. While their classification is well understood in the Hamming and rank metrics -…

Information Theory · Computer Science 2025-11-25 Usman Mushrraf , Ferdinando Zullo

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

We propose a new low-density parity-check code construction scheme based on 2-lifts. The proposed codes have an advantage of admitting efficient hardware implementations. With the motivation of designing codes with low error floors, we…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

We construct a family of two-Lee-weight codes over the ring $R_k,$ which is defined as trace codes with algebraic structure of abelian codes. The Lee weight distribution of the two-weight codes is given. Taking the Gray map, we obtain…

Information Theory · Computer Science 2016-12-19 Minjia Shi , Yue Guan

There are exactly two non-commutative rings of size $4$, namely, $E = \langle a, b ~\vert ~ 2a = 2b = 0, a^2 = a, b^2 = b, ab= a, ba = b\rangle$ and its opposite ring $F$. These rings are non-unital. A subset $D$ of $E^m$ is defined with…

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

In this paper, we first generalize the class of linear codes by Ding and Ding (IEEE TIT, 61(11), pp. 5835-5842, 2015). Then we mainly study the augmented codes of this generalized class of linear codes. For one thing, we use Gaussian sums…

Information Theory · Computer Science 2024-04-30 Ziling Heng , Keqing Cao

As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research…

Information Theory · Computer Science 2018-03-28 Ziling Heng , Cunsheng Ding , Zhengchun Zhou

Minimal rank-metric codes or, equivalently, linear cutting blocking sets are characterized in terms of the second generalized rank weight, via their connection with evasiveness properties of the associated $q$-system. Using this result, we…

Combinatorics · Mathematics 2022-09-07 Daniele Bartoli , Giuseppe Marino , Alessandro Neri

Self-orthogonal codes have received great attention due to their important applications in quantum codes, LCD codes and lattices. Recently, several families of self-orthogonal codes containing the all-$1$ vector were constructed by…

Information Theory · Computer Science 2025-08-06 Yadi Wei , Jiaxin Wang , Fang-Wei Fu

Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…

Information Theory · Computer Science 2026-05-28 Haibo Liu , Xin Guo , Qunying Liao

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

It has been known since the 1970's that the difference of the non-zero weights of a projective $\mathbb{F}_q$-linear two-weight has to be a power of the characteristic of the underlying field. Here we study non-projective two-weight codes…

Combinatorics · Mathematics 2024-02-29 Sascha Kurz

The interplay between coding theory and $t$-designs has attracted a lot of attention for both directions. It is well known that the supports of all codewords with a fixed weight in a code may hold a $t$-design. In this paper, by determining…

Combinatorics · Mathematics 2019-03-19 Xiaoni Du , Rong Wang , Chunming Tang , Qi Wang
‹ Prev 1 8 9 10 Next ›