Universal Secure Network Coding via Rank-Metric Codes

DOI10.1109/TIT.2010.2090212zbMath1366.94321arXiv0809.3546OpenAlexW2152303628WikidataQ59767700 ScholiaQ59767700MaRDI QIDQ5281101

Danilo Silva, Frank R. Kschischang

Publication date: 27 July 2017

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

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

Mathematics Subject Classification ID

Source coding (94A29)

Related Items (19)

Non-linear maximum rank distance codes in the cyclic model for the field reduction of finite geometries ⋮ Constructions of rank metric codes under actions of the unitary groups ⋮ Rank-metric codes and their duality theory ⋮ Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring ⋮ On dually almost MRD codes ⋮ How to Construct Strongly Secure Network Coding Scheme ⋮ LCP of rank metric codes and its an application ⋮ Generalized weights: an anticode approach ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Robust optimization for minimizing energy consumption of multicast transmissions in coded wireless packet networks under distance uncertainty ⋮ Universal secure rank-metric coding schemes with optimal communication overheads ⋮ How to make a linear network code (strongly) secure ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ Rank-metric complementary dual codes ⋮ Puncturing maximum rank distance codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Application of \(\mathcal{T}\)-direct codes in multiple-rate codes ⋮ Construction of LCD-MRD codes of length n > N ⋮ A new method for ensuring anonymity and security in network coding

This page was built for publication: Universal Secure Network Coding via Rank-Metric Codes