# An algebraic approach for decoding spread codes

@article{Gorla2012AnAA,
title={An algebraic approach for decoding spread codes},
author={Elisa Gorla and Felice Manganiello and Joachim Rosenthal},
year={2012},
volume={6},
pages={443-466}
}
• Published 27 July 2011
• Computer Science
In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size $k\times n$ with entries in a finite field $\mathbb F_q$. Spread codes are a family of optimal codes with maximal minimum distance. We give a minimum-distance decoding algorithm which requires $\mathcal{O}((n-k)k^3)$ operations over an extension field $\mathbb F_{q^k}$. Our algorithm is more efficient than the previous…
Optimum Distance Flag Codes from Spreads in Network Coding
• Computer Science
ArXiv
• 2020
It is shown that optimum distance flag codes attaining the best possible size, given an admissible type vector, must have a spread as the subspace code used at the corresponding shot.
Partial spreads in random network coding
• Computer Science
Finite Fields Their Appl.
• 2014
Constructions, decoding and automorphisms of subspace codes
Subspace codes are a family of codes used for (among others) random network coding, which is a model for multicast communication. These codes are deﬁned as sets of vector spaces over a ﬁnite ﬁeld.
Geometric decoding of subspace codes with explicit Schubert calculus applied to spread codes
A decoding algorithm for error-correcting subspace codes for Desarguesian spread codes, which are known to be defined as the intersection of the Pl\"ucker embedding of the Grassmannian with a linear space.
Research Statement 1 of 4 Subspace Codes for Random Network Coding 1 Classical Coding Theory ?
Algebraic coding theory studies the balance between adding mathematical redundancy to data versus the cost of sending the redundancy, and how to decode the received word to the closest codeword.
• Computer Science
Finite Fields Their Appl.
• 2014
Optimum distance flag codes from spreads via perfect matchings in graphs
• Computer Science
Journal of Algebraic Combinatorics
• 2021
The set of admissible type vectors for this family of flag codes is characterized and a construction of them is provided based on well-known results about perfect matchings in graphs.
Analysis and Constructions of Subspace Codes
This dissertation explores properties of one particular construction and introduces a new construction for subspace codes, which is recursive, and uses the linkage construction to generalize some constructions of partial spreads.
Cyclic Orbit Codes
• Computer Science
IEEE Transactions on Information Theory
• 2013
It is shown how orbit codes can be seen as an analog of linear codes in the block coding case and how the structure of cyclic orbit code can be utilized to compute the minimum distance and cardinality of a given code.
Equidistant subspace codes
• Computer Science
ArXiv
• 2015