English
Related papers

Related papers: MacWilliams' Extension Theorem for rank-metric cod…

200 papers

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 compare the two duality theories of rank-metric codes proposed by Delsarte and Gabidulin, proving that the former generalizes the latter. We also give an elementary proof of MacWilliams identities for the general case of Delsarte…

Information Theory · Computer Science 2015-04-03 Alberto Ravagnani

We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…

Information Theory · Computer Science 2013-12-18 Alexander Barg , Luciano V. Felix , Marcelo Firer , Marcos V. P. Spreafico

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

Since MacWilliams proved the original identity relating the Hamming weight enumerator of a linear code to the weight enumerator of its dual code there have been many different generalizations, leading to the development of $m$-tuple support…

Information Theory · Computer Science 2017-06-13 Nathan Kaplan

The adjacency matrix associated with a convolutional code collects in a detailed manner information about the weight distribution of the code. A MacWilliams Identity Conjecture, stating that the adjacency matrix of a code fully determines…

Information Theory · Computer Science 2007-07-13 Heide Gluesing-Luerssen , Gert Schneider

The list-decodability of random linear rank-metric codes is shown to match that of random rank-metric codes. Specifically, an $\mathbb{F}_q$-linear rank-metric code over $\mathbb{F}_q^{m \times n}$ of rate $R =…

Computational Complexity · Computer Science 2017-11-01 Venkatesan Guruswami , Nicolas Resch

In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…

Information Theory · Computer Science 2024-06-21 Umberto Martínez-Peñas , Rubén Rodríguez-Ballesteros

In this letter we consider the ensemble of codes formed by the serial concatenation of a Hamming code and two accumulate codes. We show that this ensemble is asymptotically good, in the sense that most codes in the ensemble have minimum…

Information Theory · Computer Science 2009-05-29 Alexandre Graell i Amat , Raphael Le Bidan

So far, there is no polynomial-time list decoding algorithm (beyond half the minimum distance) for Gabidulin codes. These codes can be seen as the rank-metric equivalent of Reed--Solomon codes. In this paper, we provide bounds on the list…

Information Theory · Computer Science 2016-11-17 Antonia Wachter-Zeh

The main purpose of this paper is to generalize the celebrated L${}^2$ extension theorem of Ohsawa-Takegoshi in several directions : the holomorphic sections to extend are taken in a possibly singular hermitian line bundle, the subvariety…

Algebraic Geometry · Mathematics 2017-05-24 Junyan Cao , Jean-Pierre Demailly , Shin-Ichi Matsumura

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

A modification of Kaluza-Klein theory is proposed which is general enough to admit an arbitrary finite noncommutative internal geometry. It is shown that the existence of a non-trival extension to the total geometry of a linear connection…

High Energy Physics - Theory · Physics 2009-10-28 A. Kehagias , J. Madore , J. Mourad , G. Zoupanos

We fully describe the general form of a linear (or conjugate-linear) rank metric isometry on the Murray--von Neumann algebra associated with a II$_1$-factor. As an application, we establish Frobenius' theorem in the setting of…

Operator Algebras · Mathematics 2025-06-16 Jinghao Huang , Karimbergen Kudaybergenov , Fedor Sukochev

This is a chapter of the upcoming "A Concise Encyclopedia of Coding Theory", W.C. Huffman, J.-L. Kim, and P. Sole' Eds., CRC Press. The chapter gives an introduction to the mathematical theory of rank-metric codes. Treated topics include:…

Information Theory · Computer Science 2019-02-08 Elisa Gorla

The tensor product of one code endowed with the Hamming metric and one endowed with the rank metric is analyzed. This gives a code which naturally inherits the sum-rank metric. Specializing to the product of a cyclic code and a skew-cyclic…

Information Theory · Computer Science 2021-06-01 Gianira N. Alfarano , F. J. Lobillo , Alessandro Neri , Antonia Wachter-Zeh

The classical way of extending an $[n, k, d]$ linear code $\C$ is to add an overall parity-check coordinate to each codeword of the linear code $\C$. This extended code, denoted by $\overline{\C}(-\bone)$ and called the standardly extended…

Information Theory · Computer Science 2023-12-05 Zhonghua Sun , Cunsheng Ding , Tingfang Chen

We prove a general extension theorem for holomorphic line bundles on reduced complex spaces, equipped with singular hermitian metrics, whose curvature currents can be extended as positive, closed currents. The result has applications to…

Complex Variables · Mathematics 2017-03-31 Georg Schumacher

We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. These…

Information Theory · Computer Science 2019-05-28 Alessandro Neri , Sven Puchinger , Anna-Lena Horlemann-Trautmann

In set theory without the axiom of Choice ZF, we prove that for every commutative field IK, the following statement D_{\IK}: "On every non null IK-vector space, there exists a non null linear form" implies the existence of a IK-linear…

Logic · Mathematics 2019-01-17 Marianne Morillon