Description and Decoding of q-cyclic Rank Codes
Conference: SCC'08 - 7th International ITG Conference on Source and Channel Coding
01/14/2008 - 01/16/2008 at Ulm, Germany
Proceedings: SCC'08
Pages: 6Language: englishTyp: PDF
Personal VDE Members are entitled to a 10% discount on this title
Authors:
Richter, Gerd; Senger, Christian; Bossert, Martin (Institute of Telecommunications and Applied Information Theory, TAIT, Ulm University, Albert-Einstein-Allee 43, D-89081 Ulm, Germany)
Abstract:
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.