Erasure techniques in MRD codes. (Q2883191)

The book deals with the erasure techniques in the class of concatenated MRD-codes (maximum rank distance codes). The authors introduce the new notion of concatenation of MRD codes with binary codes, where the outer code is taken as the rank distance code and the binary code as the inner code. The concatenated code consists of the codewords of the outer code expressed in terms of the alphabets of the inner code. This new class of codes is defined as the class of CRM-codes (concatenated rank metric codes). Finally, the notion of integer rank distance code is introduced.NEWLINENEWLINEThe book is organized as follows. The first chapter introduces the basic algebraic structures essential to make the book self-contained. In Chapter 2 the authors discuss algebraic linear codes and their basic properties. In Chapter 3 the authors study the basic properties of erasure decoding in maximum rank distance codes. Some decoding techniques about MRD-codes are described and discussed in Chapter 4 of the book. Next, rank distance codes with complementary duals and MRD codes with complementary duals are introduced and some applications of them are discussed. Chapter 5 introduces the notion of integer rank distance codes. The final chapter introduces some concatenation techniques.