Construction of Error-Correcting Codes for Random Network Coding
Tuvi Etzion, Natalia Silberstein
TL;DR
This paper introduces new error-correcting codes for random network coding utilizing rank-metric codes, Ferrers diagrams, and puncturing, resulting in larger codes than previously known for many parameters.
Contribution
The work develops novel error-correcting codes for network coding that outperform existing codes in size for a wide range of parameters.
Findings
Constructed codes are larger than all previously known codes for most parameters.
The codes are based on rank-metric codes, Ferrers diagrams, and puncturing techniques.
The approach improves the efficiency of error correction in random network coding.
Abstract
In this work we present error-correcting codes for random network coding based on rank- metric codes, Ferrers diagrams, and puncturing. For most parameters, the constructed codes are larger than all previously known codes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · DNA and Biological Computing · Wireless Communication Security Techniques