Combining subspace codes with classical linear error-correcting codes
Olav Geil, Louise Foshammer, Malte Neve-Gr{\ae}sb{\o}ll

TL;DR
This paper presents a method that combines subspace codes with classical linear error-correcting codes to effectively handle errors and erasures in network coding scenarios with noisy channels.
Contribution
It introduces a novel approach that integrates subspace codes with classical codes to improve error and erasure correction in network coding.
Findings
Enhanced error correction capability in network coding
Effective handling of erasures and errors simultaneously
Combines strengths of subspace and classical codes
Abstract
We discuss how subspace codes can be used to simultaneously correct errors and erasures when the network performs random linear network coding and the edges are noisy channels. This is done by combining the subspace code with a classical linear error-correcting code. The classical code then takes care of the errors and the subspace codes takes care of the erasures.
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 · Advanced Wireless Communication Technologies · Coding theory and cryptography
