Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding

DOI10.1109/TIT.2018.2797183zbMath1390.94938arXiv1604.03292OpenAlexW2791874884MaRDI QIDQ4569196

Tuvi Etzion, Antonia Wachter-Zeh

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/1604.03292

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of graph theory to circuits and networks (94C15) Combinatorial codes (94B25) Arithmetic codes (94B40) Source coding (94A29)

Related Items (7)

Almost affinely disjoint subspaces and covering Grassmannian codes ⋮ 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 ⋮ Subspace packings: constructions and bounds ⋮ Constructions of cyclic constant dimension codes ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ Rank-Metric Codes and Their Applications

This page was built for publication: Vector Network Coding Based on Subspace Codes Outperforms Scalar Linear Network Coding