English
Related papers

Related papers: MacWilliams identities for the generalized rank we…

200 papers

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 consider $q$-matroids and their associated classical matroids derived from Gabidulin rank-metric codes. We express the generalized rank weights of a Gabidulin rank-metric code in terms of Betti numbers of the dual classical matroid…

Combinatorics · Mathematics 2021-12-15 Trygve Johnsen , Rakhi Pratihar , Hugues Verdure

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

Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…

Information Theory · Computer Science 2025-11-25 Dongmei Huang , Qunying Liao , Sihem Mesnager , Gaohua Tang , Haode Yan

We define generalized Hamming weights for almost affine codes. We show how various aspects and applications of generalized Hamming weights for linear codes, such as Wei duality, generalized Kung's bound, profiles, connection to wire-tap…

Information Theory · Computer Science 2017-03-20 Trygve Johnsen , Hugues Verdure

Irreducible cyclic codes are one of the largest known classes of block codes which have been investigated for a long time. However, their weight distributions are known only for a few cases. In this paper, a class of irreducible cyclic…

Cryptography and Security · Computer Science 2013-09-06 Yun Song , Zhihui Li

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

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

In this paper, a family of five-weight reducible cyclic codes is presented. Furthermore, the weight distribution of these cyclic codes is determined, which follows from the determination of value distributions of certain exponential sums.

Information Theory · Computer Science 2015-02-13 Yan Liu , Haode Yan

We develop an algebraic theory of supports for $R$-linear codes of fixed length, where $R$ is a finite commutative unitary ring. A support naturally induces a notion of generalized weights and allows one to associate a monomial ideal to a…

Information Theory · Computer Science 2022-01-19 Elisa Gorla , Alberto Ravagnani

In this paper, we study linear spaces of matrices defined over discretely valued fields and discuss their dimension and minimal rank drops over the associated residue fields. To this end, we take first steps into the theory of rank-metric…

Number Theory · Mathematics 2023-10-16 Yassine El Maazouz , Marvin Anas Hahn , Alessandro Neri , Mima Stanojkovski

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 establish a connection between linear codes and hyperplane arrangements using the Thomas decomposition of polynomial systems and the resulting counting polynomial. This yields both a generalization and a refinement of the weight…

Information Theory · Computer Science 2014-04-14 Wilhelm Plesken , Thomas Bächler

We introduce a formula for determining the number of codewords of weight 2 in cyclic codes and provide results related to the count of codewords with weight 3. Additionally, we establish a recursive relationship for binary cyclic codes that…

Number Theory · Mathematics 2025-06-03 José G. Coelho , F. E. Brochero Martínez

The paper describes a method to determine symmetrized weight enumerators of $p^m$-linear codes based on the notion of a disjoint weight enumerator. Symmetrized weight enumerators are given for the lifted quadratic residue codes of length 24…

Combinatorics · Mathematics 2007-07-16 I. M. Duursma , M. Greferath

Stochastic linear combinations of some random vectors are studied where the distribution of the random vectors and the joint distribution of their coefficients are Dirichlet. A method is provided for calculating the distribution of these…

Statistics Theory · Mathematics 2016-03-03 Hazhir Homei

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Cyclic codes have been studied for many years, but their weight…

Information Theory · Computer Science 2013-06-25 Chengju Li , Qin Yue

Cyclic codes are a subclass of linear codes and have wide applications in consumer electronics, data storage systems, and communication systems due to their efficient encoding and decoding algorithms. Cyclic codes with many zeros and their…

Information Theory · Computer Science 2013-01-25 Zhengchun Zhou , Aixian Zhang , Cunsheng Ding , Maosheng Xiong

Cyclic codes have attracted a lot of research interest for decades. In this paper, for an odd prime $p$, we propose a general strategy to compute the complete weight enumerator of cyclic codes via the value distribution of the corresponding…

Information Theory · Computer Science 2016-03-01 Shudi Yang , Zheng-An Yao

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