Asset Details
Do you wish to reserve the book?
The Existence of 1-Error-Correcting Pair for Maximum Distance Separable (MDS) Non-Generalized Reed Solomon (GRS) code and Almost Maximum Distance Separable (AMDS) code
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
The Existence of 1-Error-Correcting Pair for Maximum Distance Separable (MDS) Non-Generalized Reed Solomon (GRS) code and Almost Maximum Distance Separable (AMDS) code
Do you wish to request the book?
The Existence of 1-Error-Correcting Pair for Maximum Distance Separable (MDS) Non-Generalized Reed Solomon (GRS) code and Almost Maximum Distance Separable (AMDS) code
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
The Existence of 1-Error-Correcting Pair for Maximum Distance Separable (MDS) Non-Generalized Reed Solomon (GRS) code and Almost Maximum Distance Separable (AMDS) code
2018
Overview
One of the topics for decoding linear codes is an error-correcting pair. In this paper, it would be proved that the non-GRS MDS code and the AMDS [n, 1, n - 1] code have 1-error-correcting pair. It will also show that the AMDS code [n, n - 1,1] has no error-correcting pair.
Publisher
IOP Publishing
Subject
