Erasure techniques in MRD codes.

MaRDI QIDQ2883191zbMATH OpenFDO

Authors W. B. Vasantha Kandasamy, Florentin Smarandache, R. Sujatha, R. S. Raja Durai

Publication date 11 May 2012

Full work available at URL https://arxiv.org/abs/1205.0789

zbMATH Keywords

algebraic linear codesconcatenation of algebraic codeserror-erasure decoding of MRD-codesinvertible \(q\)-cyclic RD-codesmaximal rank distance codesmaximum integer rank distance codesMRD-codesMRD-codes with complementary duals

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Decoding (94B35) Other types of codes (94B60)

Abstract: This book is organized into six chapters. The first chapter introduces the basic algebraic structures essential to make this book a self contained one. Algebraic linear codes and their basic properties are discussed in chapter two. In chapter three 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 four of this book. Rank distance codes with complementary duals and MRD codes with complementary duals are introduced and their applications are discussed. Chapter five introduces the notion of integer rank distance codes. The final chapter introduces some concatenation techniques.

Review text

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.

Recommendations

• Error and erasure correcting algorithms for rank codes
• MRD codes: constructions and connections
• Theory of codes with maximum rank distance
• MRD codes with maximum idealizers
• scientific article; zbMATH DE number 2154122

Cited in

(14)

• Design of \(\mathcal{T}\)-\textit{direct} codes over \(\mathrm{GF}(2^N)\) with increased users
• Some bounds on binary LCD codes
• Construction of high rate \(\mathcal {T}\)-direct codes
• Euclidean and Hermitian LCD MDS codes
• Application of \(\mathcal{T}\)-direct codes in multiple-rate codes
• Multiple-rate error-correcting coding scheme
• Further results on LCD generalized Gabidulin codes
• A coding scheme that increases the code rate
• Complementary dual codes for counter-measures to side-channel attacks
• Complementary dual codes for counter-measures to side-channel attacks
• Some important results on \(\mathcal{T}\)-direct codes
• Construction of LCD-MRD codes of length n > N
• On the hull-variation problem of equivalent vector rank-metric codes
• Enhanced multisecret-sharing schemes using LCD codes and weighing orthogonal matrices

This page was built for publication: Erasure techniques in MRD codes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883191)