Spread decoding in extension fields

A spread code is a set of vector spaces of a fixed dimension over a finite field FqFq with certain properties used for random network coding. It can be constructed in different ways which lead to different decoding algorithms. In this work we consider one such representation of spread codes and present a minimum distance decoding algorithm which is efficient when the code words, the received space and the error space have small dimension.