No label defined (Q4336984)

In the first part of the paper some applications of generalized Hamming weights to code shortening and to trellis complexity are discussed. Furthermore, the author suggests some open problems on generalized Hamming weights, including the problem to express the weight hierarchy of a product code in terms of the weight hierarchy of the component codes. In the second part some fundamental open problems in coding theory are presented in the hope of generating more interest in them. Among the problems are: whether the Shannon capacity of a nontrivial channel can be achieved in polynomial time, and how to construct simultaneously good packing and covering codes. For the entire collection see [Zbl 0859.00020].