Codes satisfying the chain condition
From MaRDI portal
Publication:4307286
DOI10.1109/18.272476zbMATH Open0811.94035OpenAlexW2154959958MaRDI QIDQ4307286FDOQ4307286
Authors: Torleiv Kløve, Sylvia Encheva
Publication date: 4 October 1994
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.272476
Recommendations
Cited In (17)
- Title not available (Why is that?)
- Minimum support weights of binary codes
- The weight hierarchies of \(q\)-ary linear codes of dimension 4
- Weight hierarchies of linear codes of dimension 3
- Generalizations of the Griesmer bound
- Title not available (Why is that?)
- Antichain codes
- Title not available (Why is that?)
- On Projective Codes Satisfying the Chain Condition
- Higher weights of anticodes and the generalized Griesmer bound.
- On the relative profiles of a linear code and a subcode
- Code constructions and existence bounds for relative generalized Hamming weight
- On linear projective codes which satisfy the chain condition.
- The determination on weight hierarchies of \(q\)-ary linear codes of dimension 5 in class IV
- Linear codes and their coordinate ordering.
- On codes satisfying the double chain condition
- Projective codes which satisfy the chain condition
This page was built for publication: Codes satisfying the chain condition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4307286)