English
Related papers

Related papers: On the generalized Hamming weights of certain Reed…

200 papers

Irreducible cyclic codes are an interesting type of codes and have applications in space communications. They have been studied for decades and a lot of progress has been made. The objectives of this paper are to survey and extend earlier…

Information Theory · Computer Science 2011-08-22 Cunsheng Ding , Jing Yang

Ideas of Rozansky and Witten, as developed by Kapranov, show that a complex symplectic manifold X gives rise to Vassiliev weight systems. In this paper we study these weight systems by using D(X), the derived category of coherent sheaves on…

Differential Geometry · Mathematics 2014-10-01 Justin Roberts , Simon Willerton

It is well-known that Reed-Solomon codes and extended Reed-Solomon codes are two special classes of MDS codes with wide applications in practice. The complete weight enumerators of these codes are very important for determining the…

Information Theory · Computer Science 2021-12-30 Canze Zhu , Qunying Liao

We consider a new class of linear codes, called affine Grassmann codes. These can be viewed as a variant of generalized Reed-Muller codes and are closely related to Grassmann codes. We determine the length, dimension, and the minimum…

Information Theory · Computer Science 2010-06-22 Peter Beelen , Sudhir R. Ghorpade , Tom Hoeholdt

For the algebra L= K <x, d/dx, \int> of polynomial integro-differential operators over a field K of characteristic zero, a classification of indecomposable, generalized weight L-modules of finite length is given. Each such module is an…

Representation Theory · Mathematics 2017-01-02 Vladimir Bavula , Victor Bekkert , Vyacheslav Futorny

In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…

Classical Analysis and ODEs · Mathematics 2023-06-01 Amílcar Branquinho , Ana Foulquié-Moreno , Assil Fradi , Manuel Mañas

In this article, we consider limit theorems for some weighted type random sums (or discrete rough integrals). We introduce a general transfer principle from limit theorems for unweighted sums to limit theorems for weighted sums via rough…

Probability · Mathematics 2017-07-07 Yanghui Liu , Samy Tindel

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

Combinatorics · Mathematics 2018-07-24 Ghodratollah Aalipour , Art M. Duval , Woong Kook , Kang-Ju Lee , Jeremy L. Martin

This paper develops an algorithmic approach for obtaining estimates of the weight enumerators of Reed-Muller (RM) codes. Our algorithm is based on a technique for estimating the partition functions of spin systems, which in turn employs a…

Information Theory · Computer Science 2024-03-12 Shreyas Jain , V. Arvind Rameshwar , Navin Kashyap

Using the notion of generalized weight we improve estimates on the parameters of quantum codes obtained by Steane's construction from binary codes. This yields several new families of quantum codes.

Quantum Physics · Physics 2007-05-23 Gérard Cohen , Sylvia Encheva , Simon Litsyn

McMullen's g-vector is important for simple convex polytopes. This paper postulates axioms for its extension to general convex polytopes. It also conjectures that, for each dimension d, a stated finite calculation gives the formula for the…

Combinatorics · Mathematics 2010-11-19 Jonathan Fine

We present a unified approach which gives completely elementary proofs of three weighted sum formulae for double zeta values. This approach also leads to new evaluations of sums relating to the harmonic numbers, the alternating double zeta…

Number Theory · Mathematics 2012-06-13 James Wan

We define and study a class of Reed-Muller type error-correcting codes obtained from elementary symmetric functions in finitely many variables. We determine the code parameters and higher weight spectra in the simplest cases.

Information Theory · Computer Science 2022-10-27 Mrinmoy Datta , Trygve Johnsen

In this paper we reformulate in a simpler way the combinatoric core of constructive quantum field theory We define universal rational combinatoric weights for pairs made of a graph and one of its spanning trees. These weights are nothing…

Mathematical Physics · Physics 2015-06-15 Vincent Rivasseau , Zhituo Wang

The goal of this text is to understand and prove a formula stated by Salmon, which gives the first terms of some Taylor expansion of the discriminant of a plane algebraic curve. Salmon uses his formula to derive various enumerative…

Algebraic Geometry · Mathematics 2025-12-10 Laurent Busé , Thomas Dedieu

Inversion theorems of Wiener type are essential tools in analysis and number theory. We derive a weighted version of an inversion theorem of Wiener type for general Dirichlet series from that of Edwards from 1957, and we outline an…

Functional Analysis · Mathematics 2012-10-02 Helge Glockner , Lutz G. Lucht

The $r$-th generalized Hamming metric and the $b$-symbol metric are two different generalizations of Hamming metric. The former is used on the wire-tap channel of Type II, and the latter is motivated by the limitations of the reading…

Cryptography and Security · Computer Science 2021-09-29 Minjia Shi , Hongwei Zhu , Tor Helleseth

This paper is motivated by the study of Alperin's weight conjecture in the representation theory of finite groups. We generalize the notion of $e$-cuspidality in the $e$-Harish-Chandra theory of finite reductive groups, and define generic…

Representation Theory · Mathematics 2025-05-29 Zhicheng Feng , Gunter Malle , Jiping Zhang

Weight systems are functions on chord diagrams satisfying Vassiliev's $4$-term relations. They originate in the theory of finite type knot invariants. Recent developments in understanding weight systems arising from Lie algebras are based…

Combinatorics · Mathematics 2025-06-02 M. Kazarian , E. Krasilnikov , S. Lando , M. Shapiro

In this paper we introduce a new class of extremal codes, namely the $i$-BMD codes. We show that for this family several of the invariants are determined by the parameters of the underlying code. We refine and extend the notion of an…

Information Theory · Computer Science 2019-12-09 Eimear Byrne , Giuseppe Cotardo , Alberto Ravagnani