Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=27895474

Bounds on List Decoding of Rank-Metric Codes

Author
WACHTER-ZEH, Antonia1 2
[1] Institute of Communications Engineering, University of Ulm, 89081 Ulm, Germany
[2] Institut de Recherche Mathémathique de Rennes (IRMAR), Université de Rennes 1, 35042 Rennes, France
Source

IEEE transactions on information theory. 2013, Vol 59, Num 11, pp 7268-7277, 10 p ; ref : 50 ref

CODEN
IETTAW
ISSN
0018-9448
Scientific domain
Telecommunications
Publisher
Institute of Electrical and Electronics Engineers, New York, NY
Publication country
United States
Document type
Article
Language
English
Author keyword
Constant-rank codes Gabidulin codes list decoding rank-metric codes
Keyword (fr)
Algorithme Borne inférieure Borne supérieure Code Reed Solomon Complexité temps Distance Hamming Distance minimale Décodage Métrique Temps polynomial
Keyword (en)
Algorithm Lower bound Upper bound Reed Solomon code Time complexity Hamming distance Minimal distance Decoding Metric Polynomial time
Keyword (es)
Algoritmo Cota inferior Cota superior Código Reed Solomon Complejidad tiempo Distancia Hamming Distancia mínima Desciframiento Métrico Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A03 Information theory

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D04 Telecommunications and information theory / 001D04A Information, signal and communications theory / 001D04A04 Signal and communications theory / 001D04A04B Coding, codes

Discipline
Telecommunications and information theory
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
27895474

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web