Network error correction. II: Lower bounds

DOI10.4310/CIS.2006.V6.N1.A3MaRDI QIDQ876557zbMATH OpenFDO

Authors Ning Cai, Raymond W. Yeung

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 codingerror correctionGilbert boundmulticastnetwork codingsingleton boundVarshamov bound

Mathematics Subject Classification ID

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

Recommendations

• Network error correction. I: Basic concepts and upper bounds
• Linear Network Error Correction Codes in Packet Networks
• Coding for Errors and Erasures in Random Network Coding
• Network codes
• Generalized minimum rank distance of variable-rate linear network error correction codes

Cited in

(14)

• On product form approximations for communication networks with losses: Error bounds
• Binary subspace codes in small ambient spaces
• An efficient MAC scheme for secure network coding with probabilistic detection
• Algebraic codes for network coding
• Constructions and bounds for mixed-dimension subspace codes
• Secure Error-Correction Network Coding in a Randomized Setting
• Matroidal error correction networks and linear network error correction MDS codes
• Lower Bounds for Multiplication via Network Coding
• Rank-metric codes and their applications
• Codes in the sum-rank metric: fundamentals and applications
• Correcting adversarial errors with generalized regenerating codes
• Ning Cai: a tribute to a pioneering scholar in information theory
• Capacity of an infinite family of networks related to the diamond network for fixed alphabet sizes
• Network error correction. I: Basic concepts and upper bounds

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

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