Rank Codes

Ernst M. Gabidulin (Autor)

Vladimir Sidorenko (Herausgeber)

Buch | Softcover

181 Seiten

2021
TUM.University Press (Verlag)
978-3-95884-062-1 (ISBN)

Infos

This textbook contains the theory and some applications of the rank metric codes developed by the author and called Gabidulin Codes by the scientific community. A matrix code C is a set of matrices (codewords) of fixed size over a finite field. The code is considered in the rank metric that is defined as follows: The distance between two matrices is the rank of their difference. The code distance of a code C is the minimum distance between different code matrices. Given a metric, the main directions of coding theory are to design codes with a maximum number of codewords for a fixed code distance, to obtain the properties of the codes, to construct effcient decoding
algorithms that find a code matrix nearest to a given matrix. This book can be recommended to students and researchers working with rank metric codes.

Produkt-Details

• Erscheinungsdatum: 14.04.2021
• Übersetzer: Vladimir Sidorenko
• Verlagsort: München
• Sprache: englisch
• Maße: 210 x 148 mm
• Themenwelt: Mathematik / Informatik ► Informatik
• Schlagworte: decoding algorithm • Department of Electrical and Computer Engineering • Fakultät für Elektrotechnik und Informationstechnik • Gabidulin code • Institute for Communications Engineering • Lehr- und Forschungseinheit für Nachrichtentechnik • matrix code • MIPT • Moscow Institute of Physics and Technology • multicomponent code • qcyclic rank code • rank code • rank code distance • Rank Metric • subspace code • subspace code distance • Symmetric Code • Technical University of Munich • Technische Universität München • tum • TU München • vector code
• ISBN-10: 3-95884-062-0 / 3958840620
• ISBN-13: 978-3-95884-062-1 / 9783958840621
• Zustand: Neuware