Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

DOI10.1109/TIT.2015.2429713zbMath1359.94713arXiv1301.5482WikidataQ57735034 ScholiaQ57735034MaRDI QIDQ2977380

Tomohiko Uyematsu, Ryutaroh Matsumoto, Jun Kurihara

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Circuits, networks (94C99) Combinatorial codes (94B25) Source coding (94A29)

Related Items

Rank weights for arbitrary finite field extensions ⋮ On dually almost MRD codes ⋮ Rank equivalent and rank degenerate skew cyclic codes ⋮ On \(q\)-Steiner systems from rank metric codes ⋮ New MRD codes from linear cutting blocking sets ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ On the generalised rank weights of quasi-cyclic codes ⋮ Some matroids related to sum-rank metric codes ⋮ Generalized weights: an anticode approach ⋮ Rank-metric codes and \(q\)-polymatroids ⋮ Message randomization and strong security in quantum stabilizer-based secret sharing for classical secrets ⋮ Rank weight hierarchy of some classes of polynomial codes ⋮ A polymatroid approach to generalized weights of rank metric codes ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ On defining generalized rank weights ⋮ On the third greedy weight of 4-dimensional codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ A geometric approach to rank metric codes and a classification of constant weight codes ⋮ Wei-type duality theorems for rank metric codes ⋮ Rank-metric lattices

This page was built for publication: Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding