Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks

DOI10.1109/TIT.2017.2766292zbMath1390.94906arXiv1612.01888WikidataQ57734998 ScholiaQ57734998MaRDI QIDQ4569202

Umberto Martínez-Peñas, Ryutaroh Matsumoto

Publication date: 27 June 2018

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

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

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

New MRD codes from linear cutting blocking sets ⋮ Evasive subspaces, generalized rank weights and near MRD codes ⋮ Rank-metric codes and \(q\)-polymatroids ⋮ Partitions of matrix spaces with an application to \(q\)-rook polynomials ⋮ Quasi optimal anticodes: structure and invariants ⋮ A polymatroid approach to generalized weights of rank metric codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Wei-type duality theorems for rank metric codes

This page was built for publication: Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks