English
Related papers

Related papers: Three-weight codes over rings and strongly walk re…

200 papers

Strongly walk regular graphs (SWRGs or $s$-SWRGs) form a natural generalization of strongly regular graphs (SRGs) where paths of length~2 are replaced by paths of length~$s$. They can be constructed as coset graphs of the duals of…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Sascha Kurz , Patrick Solé , Michael Stoll , Alfred Wassermann

Let $p$ be a prime number. Irreducible cyclic codes of length $p^2-1$ and dimension $2$ over the integers modulo $p^h$ are shown to have exactly two nonzero Hamming weights. The construction uses the Galois ring of characteristic $p^h$ and…

Information Theory · Computer Science 2019-11-19 Minjia Shi , Tor Helleseth , Patrick Sole

Linear codes have been an interesting subject of study for many years. Recently, linear codes with few weights have been constructed and extensively studied. In this paper, for an odd prime p, a class of three-weight linear codes over Fp…

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

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 a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

Information Theory · Computer Science 2024-10-04 Xiumei Li , Zongxi Chen , Fei Li

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

Information Theory · Computer Science 2013-02-05 Zhengchun Zhou , Cunsheng Ding

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

We construct a class of three-Lee-weight and two infinite families of five-Lee-weight codes over the ring $R=\mathbb{F}_2 +v\mathbb{F}_2 +v^2\mathbb{F}_2 +v^3\mathbb{F}_2 +v^4\mathbb{F}_2,$ where $v^5=1.$ The same ring occurs in the quintic…

Information Theory · Computer Science 2017-01-05 Yan Liu , Minjia Shi , Patrick Solé

In this paper, we construct an infinite family of three-weight binary codes from linear codes over the ring $R=\mathbb{F}_2+v\mathbb{F}_2+v^2\mathbb{F}_2$, where $v^3=1.$ These codes are defined as trace codes. They have the algebraic…

Information Theory · Computer Science 2018-07-03 Minjia Shi , Hongwei Zhu , Patrick Solé

We study a generalization of strongly regular graphs. We call a graph strongly walk-regular if there is an $\ell >1$ such that the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are…

Combinatorics · Mathematics 2013-01-31 Edwin R. van Dam , Gholamreza Omidi

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…

Information Theory · Computer Science 2019-05-08 Gaopeng Jian

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…

Information Theory · Computer Science 2015-10-20 Zhengchun Zhou , Nian Li , Cuiling Fan , Tor Helleseth

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-29 Thomas Honold

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

The results of [1,2] on linear homogeneous two-weight codes over finite Frobenius rings are exended in two ways: It is shown that certain non-projective two-weight codes give rise to strongly regular graphs in the way described in [1,2].…

Combinatorics · Mathematics 2014-01-30 Thomas Honold

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

A straight-line drawing of a graph is a monotone drawing if for each pair of vertices there is a path which is monotonically increasing in some direction, and it is called a strongly monotone drawing if the direction of monotonicity is…

Computational Geometry · Computer Science 2016-01-08 Stefan Felsner , Alexander Igamberdiev , Philipp Kindermann , Boris Klemz , Tamara Mchedlidze , Manfred Scheucher

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

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
‹ Prev 1 2 3 10 Next ›