 |
 |
|
|
| HAL: hal-00692600, version 1 |
| arXiv: 1205.0345 |
| Detailed view |  Export this paper |
 |
| Thirteenth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT 2012), Pomorie : Bulgaria (2012) |
|
|
|
|
| Bounds on List Decoding Gabidulin Codes |
|
|
| Antonia Wachter-Zeh 1, 2 |
|
|
| (2012-06-15) |
|
|
|
| An open question about Gabidulin codes is whether polynomial-time list decoding beyond half the minimum distance is possible or not. In this contribution, we give a lower and an upper bound on the list size, i.e., the number of codewords in a ball around the received word. The lower bound shows that if the radius of this ball is greater than the Johnson radius, this list size can be exponential and hence, no polynomial-time list decoding is possible. The upper bound on the list size uses subspace properties. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Institute of Communications Engineering [Ulm] (INT - University of Ulm.) |
|
|
|
University of Ulm |
|
|
| 2: | Institut de Recherche Mathématique de Rennes (IRMAR) |
|
|
|
CNRS : UMR6625 – Université de Rennes 1 – École normale supérieure de Cachan - ENS Cachan – Institut National des Sciences Appliquées (INSA) : - RENNES – Université de Rennes II - Haute Bretagne |
|
|
|
|
|
|
|
|
|
| Géométrie algébrique réelle |
|
|
|
|
| Subject | : | Computer Science/Information Theory and Coding Mathematics/Information Theory |
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00692600, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00692600 | |
| oai:hal.archives-ouvertes.fr:hal-00692600 | |
| From: Antonia Wachter-Zeh | |
| Submitted on: Tuesday, 1 May 2012 10:32:09 | |
| Updated on: Thursday, 3 May 2012 09:46:55 | |
