Maximum Distance Separable Codes to Order
Keywords:
Maximum distance separable, error-correcting capability of the code
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.
Downloads
- Article PDF
- TEI XML Kaleidoscope (download in zip)* (Beta by AI)
- Lens* NISO JATS XML (Beta by AI)
- HTML Kaleidoscope* (Beta by AI)
- DBK XML Kaleidoscope (download in zip)* (Beta by AI)
- LaTeX pdf Kaleidoscope* (Beta by AI)
- EPUB Kaleidoscope* (Beta by AI)
- MD Kaleidoscope* (Beta by AI)
- FO Kaleidoscope* (Beta by AI)
- BIB Kaleidoscope* (Beta by AI)
- LaTeX Kaleidoscope* (Beta by AI)
How to Cite
Published
2021-03-15
Issue
Section
License
Copyright (c) 2021 Authors and Global Journals Private Limited
This work is licensed under a Creative Commons Attribution 4.0 International License.