Network error correction. II: Lower bounds

DOI10.4310/CIS.2006.V6.N1.A3zbMATH Open1161.94451MaRDI QIDQ876557FDOQ876557

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

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

zbMATH Keywords

error correctionnetwork codingmulticastsingleton boundalgebraic codingGilbert boundVarshamov bound

Mathematics Subject Classification ID

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

Cited In (12)

• Binary subspace codes in small ambient spaces
• An efficient MAC scheme for secure network coding with probabilistic detection
• Correcting adversarial errors with generalized regenerating codes
• Constructions and bounds for mixed-dimension subspace codes
• On product form approximations for communication networks with losses: Error bounds
• Secure Error-Correction Network Coding in a Randomized Setting
• Network error correction. I: Basic concepts and upper bounds
• Codes in the sum-rank metric: fundamentals and applications
• Rank-metric codes and their applications
• Lower Bounds for Multiplication via Network Coding
• Algebraic codes for network coding
• Matroidal error correction networks and linear network error correction MDS codes

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)