Spread Codes and Spread Decoding in Network Coding
arXiv:0805.0507 · doi:10.1109/ISIT.2008.4595113
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.
References in corpus (2)
Cited by in corpus (26)
- Cyclic Orbit Codes
- Recursive Code Construction for Random Networks
- A Complete Characterization of Irreducible Cyclic Orbit Codes and their Plücker Embedding
- Problems on q-Analogs in Coding Theory
- New Improvements on the Echelon-Ferrers Construction
- Codes and Designs Related to Lifted MRD Codes
- New Lower Bounds for Constant Dimension Codes
- Construction of Codes for Network Coding
- On conjugacy classes of subgroups of the general linear group and cyclic orbit codes
- Projective Space Codes for the Injection Metric
- List Decoding of Lifted Gabidulin Codes via the Plücker Embedding
- Coding Theory and Projective Spaces
- Decoding of Subspace Codes, a Problem of Schubert Calculus over Finite Fields
- Message Encoding for Spread and Orbit Codes
- A Complete Characterization of Irreducible Cyclic Orbit Codes
- Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and Ferrers Diagrams
- Subspace Codes based on Graph Matchings, Ferrers Diagrams and Pending Blocks
- An Algebraic Approach for Decoding Spread Codes
- Geometric decoding of subspace codes with explicit Schubert calculus applied to spread codes
- Spread Decoding in Extension Fields
- Plücker Embedding of Cyclic Orbit Codes
- Hybrid Noncoherent Network Coding
- Symbol Erasure Correction Capability of Spread Codes
- q-Steiner Systems Do Exist
- Isometry and Automorphisms of Constant Dimension Codes
- Abelian Noncyclic Orbit Codes and Multishot Subspace Codes