In this book the authors study the erasure techniques in concatenated Maximum Rank Distance (MRD) codes. The authors for the first time in this book introduce the new notion of concatenation of MRD codes with binary codes, where we take the outer code as the RD 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. These new class of codes are defined as CRM codes. This concatenation techniques helps one to construct any CRM code of desired minimum distance which is not enjoyed by any other class of codes. Also concatenation of several binary codes are introduced using the newly defined notion of special blanks. These codes can be used in bulk transmission of a message into several channels and the completed work is again consolidated and received. Finally the notion of integer rank distance code is introduced. 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.
Zip Publishing, Ohio
decoding techniques, erasure techniques, Maximum Rank Distance, MRD
Smarandache, Florentin; W.B. Vasantha Kandasamy; R. Sujatha; and R.S. Raja Durai. "Erasure Techniques in MRD codes." (2012). https://digitalrepository.unm.edu/math_fsp/224
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.
Computer and Systems Architecture Commons, Data Storage Systems Commons, Digital Communications and Networking Commons, Hardware Systems Commons, Mathematics Commons, Other Computer Engineering Commons