English
Related papers

Related papers: Combinatorial metrics: MacWilliams-type identities…

200 papers

The MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a monomial map. Unlike the linear codes, in general, additive codes do not have the extension property. In this paper, an analogue of the…

Information Theory · Computer Science 2016-07-12 Serhii Dyshko

For linear codes, the MacWilliams Extension Theorem states that each linear isometry of a linear code extends to a linear isometry of the whole space. But, in general, it is not the situation for nonlinear codes. In this paper it is proved,…

Combinatorics · Mathematics 2016-06-17 Serhii Dyshko

We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…

Combinatorics · Mathematics 2025-09-26 Hopein Christofen Tang

The MacWilliams Extension Theorem states that each linear Hamming isometry of a linear code extends to a monomial map. In this paper an analogue of the extension theorem for linear codes over a module alphabet is observed. A geometric…

Information Theory · Computer Science 2017-05-29 Serhii Dyshko

Motivated by the works of Shiromoto [3] and Shi et al. [4], we study the existence of MacWilliams type identities with respect to Lee and Euclidean weight enumerators for linear codes over $\mathbb{Z}_{\ell}.$ Necessary and sufficient…

Information Theory · Computer Science 2016-07-15 Yongsheng Tang , Shixin Zhu , Xiaoshan Kai

We review the main results of the theory of rank-metric codes, with emphasis on their combinatorial properties. We study their duality theory and MacWilliams identities, comparing in particular rank-metric codes in vector and matrix…

Information Theory · Computer Science 2017-10-06 Elisa Gorla , Alberto Ravagnani

The MacWilliams' Extension Theorem is a classical result by Florence Jessie MacWilliams. It shows that every linear isometry between linear block-codes endowed with the Hamming distance can be extended to a linear isometry of the ambient…

Information Theory · Computer Science 2023-04-27 Elisa Gorla , Flavio Salizzoni

We present a short and self-contained proof of the extension property for partial isometries of the class of all finite metric spaces.

Combinatorics · Mathematics 2025-10-01 Jan Hubička , Matěj Konečný , Jaroslav Nešetřil

The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear…

Information Theory · Computer Science 2007-11-28 Maximilien Gadouleau , Zhiyuan Yan

We use derivatives to prove the equivalences between MacWilliams identity and its four equivalent forms, and present new interpretations for the four equivalent forms. Our results explicitly give out the relationships between MacWilliams…

Information Theory · Computer Science 2014-02-11 Xiaomin Bao

This paper describes a method to find a connection between combinatorial identities and hypergeometric series with a number of examples. Combinatorial identities can often be written as hypergeometric series with unit argument. In a number…

Combinatorics · Mathematics 2022-04-13 Enno Diekema

A MacWilliams Identity for convolutional codes will be established. It makes use of the weight adjacency matrices of the code and its dual, based on state space realizations (the controller canonical form) of the codes in question. The…

Information Theory · Computer Science 2008-05-23 Heide Gluesing-Luerssen , Gert Schneider

Codes over various metrics such as Rosenbloom-Tsfasman (RT), Lee, etc. have been considered. Recently, codes over poset metrics have been studied. Poset metric is a great generalization of many metrics especially the well-known ones such as…

Information Theory · Computer Science 2014-08-08 A. Seda , S. Vedat

In this paper we will discuss isometries and strong isometries for convolutional codes. Isometries are weight-preserving module isomorphisms whereas strong isometries are, in addition, degree-preserving. Special cases of these maps are…

Information Theory · Computer Science 2009-02-16 Heide Gluesing-Luerssen

This paper examines the $w$-weight enumerators of weights $w$ with maximal symmetry over finite chain rings and matrix rings over finite fields. In many cases, including the homogeneous weight, the MacWilliams identities for $w$-weight…

Rings and Algebras · Mathematics 2025-10-31 Jay A. Wood

In this work we explore a family of metrics over finite fields which respect the support of vectors. We show how these metrics can be obtained from the edge-weighted Hamming cube and, based on this representation we give a description of a…

Information Theory · Computer Science 2019-01-23 Roberto Assis Machado , Marcelo Firer

In this work we prove that a poset-block space admits a MacWilliams-type identity if and only if the poset is hierarchical and at any level of the poset, all the blocks have the same dimension. When the poset-block admits the…

Information Theory · Computer Science 2014-11-05 Jerry Anderson Pinheiro , Marcelo Firer

We search for Nicomachean identities by adding translation parameters, variable parameters, sequence products and adjoining further numbers to sequences. The solutions of definite and indefinite quadratic forms arise in this study of cubic…

Number Theory · Mathematics 2023-07-03 Seon-Hong Kim , Kenneth B. Stolarsky

We introduce a general class of regular weight functions on finite abelian groups, and study the combinatorics, the duality theory, and the metric properties of codes endowed with such functions. The weights are obtained by composing a…

Information Theory · Computer Science 2017-11-01 Alberto Ravagnani

We study the generalized rank weight distribution of a linear code. First, we provide a MacWilliams-type identity which relates the distributions of a code and its dual. Then, we give a formula for the enumerator polynomial. Finally, we…

Information Theory · Computer Science 2026-02-12 Julien Molina
‹ Prev 1 2 3 10 Next ›