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.
Recommendations
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)
