Spread Codes and Spread Decoding in Network Coding
Felice Manganiello, Elisa Gorla, Joachim Rosenthal
TL;DR
This paper introduces Spread Codes for network coding, leveraging finite projective geometry, and presents an efficient decoding algorithm capable of correcting errors up to half the minimum distance.
Contribution
The paper's main contribution is the development of a novel class of Spread Codes and an efficient decoding algorithm for use in random network coding.
Findings
Spread Codes are based on spreads in finite projective geometry.
An efficient decoding algorithm for Spread Codes is proposed.
Decoding can correct errors up to half the minimum distance.
Abstract
In this paper we introduce the class of Spread Codes for the use in random network coding. Spread Codes are based on the construction of spreads in finite projective geometry. The major contribution of the paper is an efficient decoding algorithm of spread codes up to half the minimum distance.
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.