## Abstract

The finite Grassmannian Gq(k, n) is defined as the set of all k -dimensional subspaces of the ambient space Fq n. Subsets of the finite Grassmannian are called constant dimension codes and have recently found an application in random network coding. In this setting codewords from G q(k, n) are sent through a network channel and, since errors may occur during transmission, the received words can possibly lie in G q(k, n), where k' ≠ k. In this paper, we study the balls in G q(k, n) with center that is not necessarily in Gq (k, n). We describe the balls with respect to two different metrics, namely the subspace and the injection metric. Moreover, we use two different techniques for describing these balls, one is the Plücker embedding of Gq(k, n), and the second one is a rational parametrization of the matrix representation of the codewords. With these results, we consider the problem of list decoding a certain family of constant dimension codes, called lifted Gabidulin codes. We describe a way of representing these codes by linear equations in either the matrix representation or a subset of the Plücker coordinates. The union of these equations and the linear and bilinear equations which arise from the description of the ball of a given radius provides an explicit description of the list of codewords with distance less than or equal to the given radius from the received word.