Network error correction. II: Lower bounds

DOI10.4310/CIS.2006.V6.N1.A3zbMath1161.94451MaRDI QIDQ876557

Raymond W. Yeung, Ning Cai

Publication date: 19 April 2007

Published in: Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.cis/1175791041

zbMATH Keywords

algebraic codingmulticasterror correctionnetwork codingsingleton boundGilbert boundVarshamov bound

Mathematics Subject Classification ID

Other types of codes (94B60) Communication theory (94A05)

Related Items (9)

Binary subspace codes in small ambient spaces ⋮ Constructions and bounds for mixed-dimension subspace codes ⋮ Correcting adversarial errors with generalized regenerating codes ⋮ An efficient MAC scheme for secure network coding with probabilistic detection ⋮ Algebraic codes for network coding ⋮ Secure Error-Correction Network Coding in a Randomized Setting ⋮ Matroidal error correction networks and linear network error correction MDS codes ⋮ Rank-Metric Codes and Their Applications ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

This page was built for publication: Network error correction. II: Lower bounds