English
Related papers

Related papers: Generalized Hamming weights for almost affine code…

200 papers

In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…

Information Theory · Computer Science 2024-12-19 Xina Zhang

We provide a comprehensive overview of the fundamental structural properties of weighted projective Reed-Muller codes. We give a recursive construction for these codes, under some conditions for the weights, and we use it to derive bounds…

Information Theory · Computer Science 2026-03-26 Jade Nardi , Rodrigo San-José

We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of…

Information Theory · Computer Science 2024-11-12 Rodrigo San-José

Linear codes with a few weights are very important in coding theory and have attracted a lot of attention. In this paper, we present a construction of $q$-ary linear codes from trace and norm functions over finite fields. The weight…

Information Theory · Computer Science 2017-07-25 Ziling Heng , Qin Yue

A Type IV-II Z4-code is a self-dual code over Z4 with the property that all Euclidean weights are divisible by eight and all codewords have even Hamming weight. In this paper we use generalized bent functions for a construction of…

Information Theory · Computer Science 2022-11-03 Sara Ban , Sanja Rukavina

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

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

A new generalization of the Gray map is introduced. The new generalization $\Phi: Z_{2^k}^n \to Z_{2}^{2^{k-1}n}$ is connected with the known generalized Gray map $\phi$ in the following way: if we take two dual linear $Z_{2^k}$-codes and…

Combinatorics · Mathematics 2009-10-05 Denis Krotov

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

In this paper we study codes where the alphabet is a finite Frobenius bimodule over a finite ring. We discuss the extension property for various weight functions. Employing an entirely character-theoretic approach and a duality theory for…

Information Theory · Computer Science 2016-11-14 Heide Gluesing-Luerssen , Tefjol Pllaha

Recently, the weight distributions of the duals of the cyclic codes with two zeros have been obtained for several cases. In this paper we provide a slightly different approach toward the general problem and use it to solve one more special…

Number Theory · Mathematics 2011-11-15 Maosheng Xiong

Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…

Information Theory · Computer Science 2015-06-12 Yeow Meng Chee , Han Mao Kiah , Punarbasu Purkayastha , Patrick Solé

We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…

Information Theory · Computer Science 2009-09-29 Gérard Cohen , Alexander Vardy

All simple weight modules with finite dimensional weight spaces over affine Lie algebras are classified.

Representation Theory · Mathematics 2009-10-06 Ivan Dimitrov , Dimitar Grantcharov

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, a class of $q$-ary linear codes with few weights are presented and their weight distributions are determined using Gauss periods. Some of…

Information Theory · Computer Science 2018-11-26 Gaopeng Jian

In this note we show that the minimum distance of a linear code equals one plus the smallest shift in the first step of the minimal graded free resolution of the Orlik-Terao algebra (i.e., the initial degree of the Orlik-Tearo ideal)…

Information Theory · Computer Science 2024-06-07 Stefan O. Tohaneanu

The weight hierarchy of generalized Reed-Muller codes over arbitrary finite fields was determined by Heijnen and Pellikaan. In this paper we produce curves over finite fields with many points which are closely related to this weight…

alg-geom · Mathematics 2007-05-23 Gerard van der Geer , Marcel van der Vlugt

We define almost affine vector rank-metric codes as subsets $\mathcal{C}\subseteq \mathbb{F}_{q^m}^n$ whose canonical projections have cardinalities that are powers of $q^m$, and prove that they naturally induce $q$-matroids. We establish…

Combinatorics · Mathematics 2026-05-29 Matteo Bonini , Johan Vester Dinesen

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…

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

This paper investigates the generalized rank weights, with a definition implied by the study of the generalized rank weight enumerator. We study rank metric codes over $L$, where $L$ is a finite Galois extension of a field $K$. This is a…

Information Theory · Computer Science 2017-10-24 Relinde Jurrius , Ruud Pellikaan
‹ Prev 1 4 5 6 7 8 10 Next ›