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

DOI10.1109/TIT.2017.2766292MaRDI QIDQ4569202zbMATH OpenDBLPWikidataFDO

Authors 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

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

Abstract: Universal security over a network with linear network coding has been intensively studied. However, previous linear codes and code pairs used for this purpose were linear over a larger field than that used on the network, which restricts the possible packet lengths of optimal universal secure codes, does not allow to apply known list-decodable rank-metric codes and requires performing operations over a large field. In this work, we introduce new parameters (relative generalized matrix weights and relative dimension/rank support profile) for code pairs that are linear over the field used in the network, and show that they measure the universal security performance of these code pairs. For one code and non-square matrices, generalized matrix weights coincide with the existing Delsarte generalized weights, hence we prove the connection between these latter weights and secure network coding, which was left open. As main applications, the proposed new parameters enable us to: 1) Obtain optimal universal secure linear codes on noiseless networks for all possible packet lengths, in particular for packet lengths not considered before, 2) Obtain the first universal secure list-decodable rank-metric code pairs with polynomial-sized lists, based on a recent construction by Guruswami et al, and 3) Obtain new characterizations of security equivalences of linear codes. Finally, we show that our parameters extend relative generalized Hamming weights and relative dimension/length profile, respectively, and relative generalized rank weights and relative dimension/intersection profile, respectively.

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4569202)