An algebraic approach for decoding spread codes

  title={An algebraic approach for decoding spread codes},
  author={Elisa Gorla and Felice Manganiello and Joachim Rosenthal},
  journal={Adv. Math. Commun.},
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
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
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 defined as sets of vector spaces over a finite field.
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.
Spread decoding in extension fields
Optimum distance flag codes from spreads via perfect matchings in graphs
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
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


Construction of Large Constant Dimension Codes with a Prescribed Minimum Distance
A method of Braun, Kerber and Laue which they used for the construction of designs over finite fields to construct constant dimension codes is modified and many new constant Dimension codes with a larger number of codewords than previously known codes are found.
Algebraic list-decoding on the operator channel
For any integer L, the list-L decoder guarantess successful recovery of the message subspace provided the normalized dimension of the error is at most L − L2(L + 1) over 2 R where R is the normalized rate of the code.
Coding for Errors and Erasures in Random Network Coding
A Reed-Solomon-like code construction, related to Gabidulin's construction of maximum rank-distance codes, is described and a Sudan-style ldquolist-1rdquo minimum-distance decoding algorithm is provided.
Error-Correcting Codes in Projective Spaces Via Rank-Metric Codes and Ferrers Diagrams
This paper proposes a method to design error-correcting codes in the projective space by using a multilevel approach to design a new class of rank-metric codes and presents a decoding algorithm to the constructed codes.
A Rank-Metric Approach to Error Control in Random Network Coding
The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of Rotter and Kschischang and an efficient decoding algorithm is proposed that can properly exploit erasures and deviations.
A Welch-Berlekamp Like Algorithm for Decoding Gabidulin Codes
The decoding of Gabidulin codes can be seen as an instance of the problem of reconstruction of linearized polynomials, which leads to the design of two efficient decoding algorithms inspired from the Welch–Berlekamp decoding algorithm for Reed–Solomon codes.
A complete characterization of irreducible cyclic orbit codes and their Plücker embedding
This paper gives a complete characterization of orbit codes that are generated by an irreducible cyclic group, i.e. a group having one generator that has no non-trivial invariant subspace.
Spread codes and spread decoding in network coding
The paper introduces the class of spread codes for the use in random network coding and proposes an efficient decoding algorithm up to half the minimum distance.
Fast decoding of rank-codes with rank errors and column erasures
  • G. Richter, S. Plass
  • Computer Science
    International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.
  • 2004
A new modified Berlekamp-Massey algorithm for correcting rank errors and column erasures is described, which is about half as complex as the known algorithms.
On Linear Network Coding
This work demonstrates how codes with one notion of linearity can be used to build, in a distributed manner, codes with another notion oflinearity, and introduces the new class of filter-bank network codes of which all previous definitions of linear network codes are special cases.