A lower bound on the weight hierarchies of product codes.
type: Item
instance of: scholarly article
title: A lower bound on the weight hierarchies of product codes.
zbMATH Open document ID: 1034.94019
DOI: 10.1016/S0166-218X(02)00449-3
author: Wolfgang Willems
author: Hans G. Schaathun
published in: Discrete Applied Mathematics
publication date: 2003-06-10T00:00:00Z
review text: The concepts of generalized Hamming weight and weight hierarchy of an error correcting code were first introduced by \textit{V. K. Wei} [Generalized Hamming weights for linear codes, IEEE Trans. Inf. Theory 37, 1412--1418 (1991; Zbl 0735.94008)], motivated by the cryptographic problem of the wire-tap channel of type II. The weight hierarchy of an \([n,k,d]\) linear code \({\mathcal C}\) is the sequence \(d_1=d <d_2 <\cdots <d_k=n\), where \(d_r\), the \(r\)th generalized Hamming weight, is the minimum support weight of the \(r\)-dimensional subcodes of \({\mathcal C}\). In that paper Wei proposed, among other open problems, the characterization of the weight hierarchy of a product code \({\mathcal C}={\mathcal C}_1\otimes {\mathcal C}_2\) in terms of the hierarchies of the factor codes \({\mathcal C}_i\). \textit{V. K. Wei} and \textit{K. C. Yang} [On the generalized Hamming weight of product codes, IEEE Trans. Inf. Theory 39, 1709--1713 (1993; Zbl 0801.94016)] establish a conjecture for such a hierarchy providing that the factor codes satisfy a certain \` \` chain condition''. Many authors, as those mentioned in the references of this paper, have contributed to solving some particular instances of the conjecture, which was finally demonstrated in an independent way, and using different techniques, by both authors of this paper [\textit{H. G. Schaathun}, The weight hierarchy of product codes, IEEE Trans. Inf. Theory 46, 2648--2651 (2000; Zbl 1001.94053); \textit{C. Martinez-Perez} and \textit{W. Willems}, On the weight hierarchy of product codes, preprint (2001)]. The present authors demonstrate, using the techniques from the paper of Schaathun, a generalization of the conjecture. They consider the product of \(t\) codes \({\mathcal C}={\mathcal C}_1\otimes \cdots \otimes{\mathcal C}_t\) and they give the following result (\(d_r^{*}\) was defined in the paper of Wei and Yang): \(d_r({\mathcal C})\geq d_r^{*}({\mathcal C}),\, r=1, \dots, k\). Moreover equality holds …
Mathematics Subject Classification ID: 94B65
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 1925286
zbMATH Keywords: product code
zbMATH Keywords: weight hierarchy
zbMATH Keywords: chain condition
zbMATH Keywords: projective multiset
reviewed by: Juan Tena Ayuso
MaRDI profile type: Publication
cites work: Weight hierarchy of a product code
cites work: Dimension/length profiles and trellis complexity of linear block codes
cites work: Q4002797
cites work: The weight hierarchies of some product codes
cites work: The weight distribution of irreducible cyclic codes with block lengths \(n_1 ((q^\ell-1)/N)\)
cites work: Generalized Hamming weights of linear codes
cites work: The weight hierarchy of product codes
cites work: Generalized Hamming weights for linear codes
cites work: On the generalized Hamming weights of product codes
Recommended article: A lower bound on the greedy weights of product codes
Recommended article: On the generalized Hamming weights of product codes
Recommended article: On the second generalized Hamming weight of the dual code of a double-error-correcting binary BCH code
Recommended article: Q4038745
Recommended article: The Determination of the Chain Good Weight Hierarchies with High Dimension
Recommended article: The weight hierarchies of outer product codes
Recommended article: On the generalized Hamming weights of convolutional codes
Recommended article: Generalized Hamming weights of linear codes
Recommended article: Geometric approach to higher weights
Recommended article: The weight hierarchies of some product codes
description: scientific article; zbMATH DE number 1925286