Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes

DOI10.1109/TIT.2019.2912165zbMath1432.94207arXiv1805.03789OpenAlexW3104978253WikidataQ127979176 ScholiaQ127979176MaRDI QIDQ5224111

Umberto Martínez-Peñas, Frank R. Kschischang

Publication date: 19 July 2019

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

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

zbMATH Keywords

multishot network codingworst-case adversarial setting

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cryptography (94A60) Bounds on codes (94B65) Other types of codes (94B60) Applications of design theory to circuits and networks (94C30) Decoding (94B35)

Related Items

Anticodes in the sum-rank metric, Sum-rank product codes and bounds on the minimum distance, Twisted linearized Reed-Solomon codes: a skew polynomial framework, A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices, Duals of linearized Reed-Solomon codes, Systematic maximum sum rank codes, Constructions of optimal rank-metric codes from automorphisms of rational function fields, Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory, Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes, Distinguishing and recovering generalized linearized Reed-Solomon codes, An algorithm for decoding skew Reed-Solomon codes with respect to the skew metric, Theory of supports for linear codes endowed with the sum-rank metric, Hamming and simplex codes for the sum-rank metric, Codes in the Sum-Rank Metric: Fundamentals and Applications