Rank weights for arbitrary finite field extensions

DOI10.3934/amc.2020083zbMath1481.94159arXiv1902.00733OpenAlexW2913326635MaRDI QIDQ825922

Odile Garotta, Grégory Berhuy, Jean Fasel

Publication date: 18 December 2021

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.00733

zbMATH Keywords

coding theorynetwork codingrank metric codesWeil restrictiongeneralized rank weightsrank supports

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Other types of codes (94B60)

Related Items (3)

On the generalised rank weights of quasi-cyclic codes ⋮ Rank weight hierarchy of some classes of polynomial codes ⋮ A polymatroid approach to generalized weights of rank metric codes

Cites Work

• On defining generalized rank weights
• Galois invariance, trace codes and subfield subcodes
• Theory of codes with maximum rank distance
• Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
• Rational Points on Varieties
• Generalized rank weights: A duality statement
• Néron Models
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Pseudo-reductive Groups

This page was built for publication: Rank weights for arbitrary finite field extensions