scientific article; zbMATH DE number 1009723
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].
- On the number of solutions of polynomial systems
- On the Weight of Halfspaces over Hamming Balls
- Open problems in coding theory
- scientific article; zbMATH DE number 5629718 (Why is no real title available?)
- scientific article; zbMATH DE number 6123029 (Why is no real title available?)
- Radon transforms and packings
- Computing generalized hamming weights of binary linear codes via free resolutions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336984)