English
Related papers

Related papers: A MacWilliams Identity for Convolutional Codes: Th…

200 papers

We develop an intrinsic enumerator framework for quantum error correction in unitary representations of symmetry groups. An intrinsic quantum code is a subspace of a representation $V$ of a group $G$, and errors are organized by the…

Quantum Physics · Physics 2026-04-20 Eric Kubischta , Ian Teixeira

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

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

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

A generalization of the Chu-Vandermonde convolution is presented and proved with the integral representation method. This identity can be transformed into another identity, which has as special cases two known identities. Another identity…

Combinatorics · Mathematics 2021-10-27 M. J. Kronenburg

The Doob scheme $D(m,n'+n'')$ is a metric association scheme defined on $E_4^m \times F_4^{n'}\times Z_4^{n''}$, where $E_4=GR(4^2)$ or, alternatively, on $Z_4^{2m} \times Z_2^{2n'} \times Z_4^{n''}$. We prove the MacWilliams identities…

Information Theory · Computer Science 2019-02-04 Denis S. Krotov

Past few years have seen an extensive use of 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, which can be…

Information Theory · Computer Science 2013-07-09 Minjia Shi

We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code's locality. Using a…

Information Theory · Computer Science 2023-09-08 Anina Gruica , Benjamin Jany , Alberto Ravagnani

Pomset block metric is a generalization of pomset metric. In this paper, we define weight enumerator of linear block codes in pomset metric over $\mathbb{Z}_m$ and establish MacWilliams type identities for linear block codes with respect to…

Information Theory · Computer Science 2023-03-06 W. Ma , J. Luo

Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumerators are proved. Two…

Rings and Algebras · Mathematics 2013-07-12 Bahattin Yildiz , Suat Karadeniz

In 1997 Rosenthal and York defined generalized Hamming weights for convolutional codes, by regarding a convolutional code as an infinite dimensional linear code endowed with the Hamming metric. In this paper, we propose a new definition of…

Information Theory · Computer Science 2022-07-26 Elisa Gorla , Flavio Salizzoni

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

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

Consider the identification (ID) via channels problem, where a receiver wants to decide whether the transmitted identifier is its identifier, rather than decoding the identifier. This model allows to transmit identifiers whose size scales…

Information Theory · Computer Science 2021-06-28 Onur Günlü , Joerg Kliewer , Rafael F. Schaefer , Vladimir Sidorenko

Let $\mathcal{P}$ be a poset on $[n]$, $\mathcal{I}(\mathcal{P})$ the set of order ideals of $\mathcal{P}$ and $E$ an equivalence relation on $\mathcal{I}(\mathcal{P})$. The concepts of the dual relation $E^*$ of an equivalence relation…

Combinatorics · Mathematics 2013-01-03 Soohak Choi , Jong Yoon Hyun , Hyun Kwang Kim , Dong Yeol Oh

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

Self-dual binary linear codes have been extensively studied and classified for length n <= 40. However, little attention has been paid to linear codes that coincide with their orthogonal complement when the underlying inner product is not…

Information Theory · Computer Science 2026-05-12 Patrick King , Mikhail Kotchetov

The MacWilliams extension theorem is investigated for various weight functions over finite Frobenius rings. The problem is reformulated in terms of a local-global property for subgroups of the general linear group. Among other things, it is…

Information Theory · Computer Science 2014-03-27 Aleams Barra , Heide Gluesing-Luerssen

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

By applying the derivative operators to Chu-Vandermonde convolution, several general harmonic number identities are established.

Combinatorics · Mathematics 2012-01-04 Chuanan Wei , Dianxuan Gong , Qin Wang