Rank weight hierarchy of some classes of polynomial codes
From MaRDI portal
Recommendations
- Classification of weight hierarchies of q-ary linear codes of dimension k
- The weight hierarchy of Hadamard codes
- Polynomial weights and code constructions
- The weight hierarchy of the Kasami codes
- Weight hierarchies of linear codes satisfying the chain condition
- A polymatroid approach to generalized weights of rank metric codes
- Weight hierarchies of linear codes satisfying the almost chain condition
- A Class of Polynomial Codes
- Weight hierarchies of linear codes satisfying the near-chain condition
- The Weight Hierarchy of Hermitian Codes
Cites work
- A polymatroid approach to generalized weights of rank metric codes
- Codes with the rank metric and matroids
- Fundamentals of Error-Correcting Codes
- Maximum-rank array codes and their application to crisscross error correction
- On defining generalized rank weights
- On the dimension of subfield subcodes
- Rank weights for arbitrary finite field extensions
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- Theory of codes with maximum rank distance
Cited in
(6)- Weight distribution of rank-metric codes
- Rank-metric codes as ideals for subspace codes and their weight properties
- On the roots and minimum rank distance of skew cyclic codes
- Polynomial weights and code constructions
- On the generalised rank weights of quasi-cyclic codes
- On the rank weight hierarchy of M-codes
This page was built for publication: Rank weight hierarchy of some classes of polynomial codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701481)
