Rank weight hierarchy of some classes of polynomial codes
From MaRDI portal
Publication:2701481
DOI10.1007/s10623-022-01181-6OpenAlexW4313334653MaRDI QIDQ2701481
Frédérique Oggier, Jérôme Ducoat
Publication date: 28 April 2023
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01181-6
Polynomials over finite fields (11T06) Relations with coding theory (11H71) Theory of error-correcting codes and error-detecting codes (94Bxx)
Related Items (2)
On the generalised rank weights of quasi-cyclic codes ⋮ On the roots and minimum rank distance of skew cyclic codes
Uses Software
Cites Work
- On defining generalized rank weights
- Rank weights for arbitrary finite field extensions
- Theory of codes with maximum rank distance
- Codes with the rank metric and matroids
- A polymatroid approach to generalized weights of rank metric codes
- Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
- On the dimension of subfield subcodes
- Fundamentals of Error-Correcting Codes
- Maximum-rank array codes and their application to crisscross error correction
This page was built for publication: Rank weight hierarchy of some classes of polynomial codes
