Richter, Gerd; Senger, Christian; Bossert, Martin (Institute of Telecommunications and Applied Information Theory, TAIT, Ulm University, Albert-Einstein-Allee 43, D-89081 Ulm, Germany)
This paper investigates q-cyclic Rank Codes, which are a subclass of codes with maximum rank distance. These codes are the analogon for the rank metric to cyclic Reed-Solomon codes for the Hamming metric. Similar to Reed-Solomon codes we define a discrete Fourier transform and its inverse for these codes. Furthermore, we show how to efficiently decode q-cyclic Rank Codes by making use of the discrete Fourier transform.