Abstract

Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance to length approaching (1 −R ) for given R, 0 < R < 1 are derived. For given rate R = , with p not dividing n, series of codes over finite fields of characteristic p are constructed such that the ratio of the distance to the length approaches (1 −R ). For a given field GF(q) MDS codes of the form (q −1, r ) are constructed for any r. The codes are encompassing, easy to construct with efficient encoding and decoding algorithms of complexity max {O(n log n ), t 2}, where t is the error-correcting capability of the code.

How to Cite
HURLEY, DONNY HURLE, BARRY HURLEY, Ted. Maximum Distance Separable Codes to Order. Global Journal of Science Frontier Research, [S.l.], oct. 2021. ISSN 2249-4626. Available at: <https://journalofscience.org/index.php/GJSFR/article/view/3016>. Date accessed: 23 jan. 2022.