English
Related papers

Related papers: Further Results on Homogeneous Two-Weight Codes

200 papers

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

Delsarte showed that for any projective linear code over a finite field of characteristic p with two nonzero Hamming weights w1 < w2 there exist positive integers u and s such that w1 = (p^s)u and w2 = (p^s)(u+1). Moreover, he showed that…

Combinatorics · Mathematics 2015-10-16 Eimear Byrne , Michael Kiermaier , Alison Sneyd

Projective two-weight linear codes are closely related to finite projective spaces and strongly regular graphs. In this paper, a family of $q$-ary projective two-weight linear codes is presented, where $q$ is a power of 2. The parameters of…

Information Theory · Computer Science 2021-03-26 Ziling Heng , Dexiang Li , Jiao Du , Fuling Chen

A code is said to be two-weight if the non-zero codewords have only two different a weight w1 and w2. Two-weight codes are closely related to strongly regular graphs. In this paper. It is shown that a consta-cyclic code of composite length…

Information Theory · Computer Science 2009-01-12 Eric Z. Chen

Few-weight codes over finite chain rings are associated with combinatorial objects such as strongly regular graphs (SRGs), strongly walk-regular graphs (SWRGs) and finite geometries, and are also widely used in data storage systems and…

Information Theory · Computer Science 2023-05-16 Shitao Li , Minjia Shi

In this paper, for an odd prime $p$, several classes of two-weight linear codes over the finite field $\mathbb{F}_p$ are constructed from the defining sets, and then their complete weight distributions are determined by employing character…

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

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, 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 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

The values of the normalized homogeneous weight are determined for arbitrary finite Frobenius rings and expressed in a form that is independent from a generating character and the M\"obius function on the ring. The weight naturally induces…

Information Theory · Computer Science 2014-03-19 Heide Gluesing-Luerssen

It is well-known that few-weight linear codes have better applications in secret sharing schemes \cite{JY2006,CC2005}.In particular, projective two-weight codes are very precious as they are closely related to finite projective spaces,…

Information Theory · Computer Science 2022-11-10 Canze Zhu , Qunying Liao

Let R > S be finite Frobenius rings for which there exists a trace map T from R onto S as left S modules. Let C:= {x -> T(ax + bf(x)) : a,b in R}. Then C is an S-linear subring-subcode of a left linear code over R. We consider functions f…

Rings and Algebras · Mathematics 2011-01-10 Eimear Byrne

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

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

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

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

In this paper we find the second generalized Hamming weight of some evaluation codes arising from a projective torus, and it allows to compute the second generalized Hamming weight of the codes parameterized by the edges of any complete…

Information Theory · Computer Science 2018-10-22 Manuel González Sarabia , Eduardo Camps , Eliseo Sarmiento , Rafael H. Villarreal

With a small suitable modification, dropping the projectivity condition, we extend the notion of a Frobenius algebra to grant that a Frobenius algebra over a Frobenius commutative ring is itself a Frobenius ring. The modification introduced…

Rings and Algebras · Mathematics 2019-07-18 José Gómez-Torrecillas , Erik Hieta-aho , F. J. Lobillo , Sergio López-Permouth , Gabriel Navarro
‹ Prev 1 2 3 10 Next ›