English
Related papers

Related papers: The MacWilliams Identity for Krawtchouk Associatio…

200 papers

In this work we characterize the combinatorial metrics admitting a MacWilliams-type identity and describe the group of linear isometries of such metrics. Considering coverings that are not connected, we classify the metrics satisfying the…

Information Theory · Computer Science 2017-03-27 Jerry Anderson Pinheiro , Roberto Assis Machado , Marcelo Firer

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

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

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

Peter Denton, Stephen Parke, Terence Tao and Xining Zhang [arxiv 2019] presented a basic and important identity in linear commutative algebra, so-called {\bf the eigenvector-eigenvalue identity} (formally named in [BAMS, 2021]), which is a…

Rings and Algebras · Mathematics 2022-07-11 Yuchao He , Mengda Wu , Yonghui Xia

In this paper, we define dual codes over arbitrary finite rings with respect to arbitrary bilinear forms and provide a generalization of Hayden's theorem (Bridges, Hall, and Hayden, 1981). Building on this foundation, we introduce the…

Combinatorics · Mathematics 2026-05-05 Futo Takabayashi

The Equivalence Theorem states that, for a given weight on the alphabet, every linear isometry between linear codes extends to a monomial transformation of the entire space. This theorem has been proved for several weights and alphabets,…

Rings and Algebras · Mathematics 2011-10-10 Marcus Greferath , Cathy Mc Fadden , Jens Zumbrägel

Past few years have seen an extensive use of high-density RAM chips with wide I/O data (e.g., 16, 32, 64 bits) in computer memory systems. These chips are highly vulnerable to a special type of byte error, called an $m$-spotty byte error,…

Information Theory · Computer Science 2011-11-14 Amit K. Sharma , Anuradha Sharma

We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…

Number Theory · Mathematics 2011-11-11 Noam D. Elkies , Scott Duke Kominers

We extend Ravagnani's MacWilliams duality theory to the settings of rank metric codes over finite chain rings, relating the sequences of $q$-binomial moments of a rank metric code over this class of rings with those of its dual.

Information Theory · Computer Science 2024-08-13 Iván Blanco-Chacón , Alberto F. Boix , Marcus Greferath , Erik Hieta-aho

We derive combinatorial identities for variables satisfying specific systems of commutation relations, in particular elliptic commutation relations. The identities thus obtained extend corresponding ones for $q$-commuting variables $x$ and…

Combinatorics · Mathematics 2018-06-05 Michael J. Schlosser , Meesue Yoo

MacWilliams identities relate the weight enumerators of a code with those of its dual and are classically formulated with respect to the Hamming weight. For other metrics, however, these identities often fail when considering the weight…

Commutative Algebra · Mathematics 2026-01-26 Jessica Bariffi , Giulia Cavicchioni , Violetta Weger

We initiate the study of the duality theory of locally recoverable codes, with a focus on the applications. We characterize the locality of a code in terms of the dual code, and introduce a class of invariants that refine the classical…

Information Theory · Computer Science 2022-12-16 Anina Gruica , Benjamin Jany , Alberto Ravagnani

Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…

Number Theory · Mathematics 2022-01-24 Nathan Kaplan

Association rule mining aims to explore large transaction databases for association rules. Classical Association Rule Mining (ARM) model assumes that all items have the same significance without taking their weight into account. It also…

Databases · Computer Science 2010-04-22 P. Velvadivu , K. Duraisamy

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

Linear codes with a few weights have important applications in authentication codes, secret sharing, consumer electronics, etc.. The determination of the parameters such as Hamming weight distributions and complete weight enumerators of…

Information Theory · Computer Science 2017-11-15 Minglong Qi , Shengwu Xiong , Jingling Yuan , Wenbi Rao , Luo Zhong

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

When the experimental objective is expressed by a set of estimable functions, and any eigenvalue-based optimality criterion is selected, we prove the equivalence of the recently introduced weighted optimality and the 'standard' optimality…

Statistics Theory · Mathematics 2016-10-21 Samuel Rosa

The Burrows-Wheeler transform (BWT) is a well studied text transformation widely used in data compression and text indexing. The BWT of two strings can also provide similarity measures between them, based on the observation that the more…

Data Structures and Algorithms · Computer Science 2020-09-10 Felipe A. Louza , Guilherme P. Telles , Simon Gog , Liang Zhao