English
Related papers

Related papers: The second generalized Hamming weight of some eval…

200 papers

We consider linear codes over some fixed finite field extension over an arbitrary finite field. Gabidulin introduced rank metric codes, by endowing linear codes over the extension field with a rank weight over the base field and studied…

Information Theory · Computer Science 2013-11-01 Jérôme Ducoat

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

In the past few years, linear codes with few weights and their weight analysis have been widely studied. In this paper, we further investigate a class of two-weight or three-weight linear codes from defining sets and determine their weight…

Information Theory · Computer Science 2020-09-11 Dabin Zheng , Qing Zhao , Xiaoqiang Wang , Yan Zhang

The generalized Hamming weight (GHW) $d_r(C)$ of linear codes $C$ is a natural generalization of the minimum Hamming distance $d(C)(=d_1(C))$ and has become one of important research objects in coding theory since Wei's originary work [23]…

Information Theory · Computer Science 2014-10-13 Minghui Yang , Jin Li , Keqin Feng , Dongdai Lin

We study the locally recoverable codes on algebraic curves. In the first part of this article, we provide a bound of generalized Hamming weight of these codes. Whereas in the second part, we propose a new family of algebraic geometric LRC…

Commutative Algebra · Mathematics 2016-05-25 Edoardo Ballico , Chiara Marcolla

In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…

Information Theory · Computer Science 2011-12-16 Manuel Gonzalez Sarabia , Carlos Renteria Marquez , Eliseo Sarmiento Rosales

A fundamental property of codes, the second-order weight distribution, is proposed to solve the problems such as computing second moments of weight distributions of linear code ensembles. A series of results, parallel to those for weight…

Information Theory · Computer Science 2011-11-15 Shengtian Yang

Codes on hypergraphs are an extension of the well-studied family of codes on bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes on regular t-partite hypergraphs whose minimum distance improves earlier estimates…

Information Theory · Computer Science 2008-12-10 Alexander Barg , Arya Mazumdar , Gilles Zémor

We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight…

Information Theory · Computer Science 2013-04-09 Stéphane Ballet , Robert Rolland

Generalized pair weights of linear codes are generalizations of minimum symbol-pair weights, which were introduced by Liu and Pan \cite{LP} recently. Generalized pair weights can be used to characterize the ability of protecting information…

Information Theory · Computer Science 2022-04-19 Hongwei Liu , Xu Pan

We give formulas, in terms of graph theoretical invariants, for the minimum distance and the generalized Hamming weights of the linear code generated by the rows of the incidence matrix of a signed graph over a finite field, and for those…

Information Theory · Computer Science 2020-09-10 Jose Martinez-Bernal , Miguel A. Valencia , Rafael H. Villarreal

This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is…

Combinatorics · Mathematics 2026-01-05 Sascha Kurz , Ivan Landjev , Assia Rousseva

We describe the second (generalized) Feng-Rao distance for elements in an Arf numerical semigroup that are greater than or equal to the conductor of the semigroup. This provides a lower bound for the second Hamming weight for one point AG…

Information Theory · Computer Science 2017-02-28 J. I. Farrán , P. A. García-Sánchez , B. A. Heredia

Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…

Information Theory · Computer Science 2010-02-25 Diego Ruano

We give necessary conditions for a two-weight projective cyclic code to be the direct sum of two one-weight irreducible cyclic subcodes of the same dimension, following the work of Wolfmann and Vega. This confirms Vega's conjecture that all…

Information Theory · Computer Science 2012-11-15 Tao Feng

In this paper, we introduce generalized extended Hamming codes over Galois rings $GR(2^n,m)$ of characteristic $2^n$ with extension degree $m$. Furthermore we prove that the minimum Hamming weight of generalized extended Hamming codes over…

Information Theory · Computer Science 2013-10-22 Muhammad Ilyas , Mieko Yamada

We give an independent combinatorial proof of Nogin's Theorem concerning the minimum distance of the Grassmann codes using a special decomposition of the Grassmannians. We use the same idea to also compute the second minimum weight of the…

Combinatorics · Mathematics 2025-08-27 Mrinmoy Datta , Tiasa Dutta

The duals of cyclic codes with two zeros have been extensively studied, and their weight distributions have recently been evaluated in some cases. In this note, we determine the weight distribution of a certain new class of such codes by…

Combinatorics · Mathematics 2012-06-18 Tao Feng , Koji Momihara

Relative generalized Hamming weights (RGHWs) of a linear code respect to a linear subcode determine the security of the linear ramp secret sharing scheme based on the code. They can be used to express the information leakage of the secret…

Information Theory · Computer Science 2015-05-28 Jun Zhang , Keqin Feng

We obtain certain algebraic invariants relevant to study codes on subgroups of weighted projective tori inside an $n$-dimensional weighted projective space. As application, we compute all the main parameters of generalized toric codes on…

Algebraic Geometry · Mathematics 2023-11-06 Mesut Şahin , Oğuz Yayla