Maximum Distance Separable Codes to Order
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 = r n, 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
URL: https://www.journalofscience.org/index.php/GJSFR/article/view/3016
References
Richard Blahut (2003) Algebraic Codes for Data Transmission.
A. Calderbank, E. Rains, P. Shor, N. Sloane (1998) Quantum error correction via codes over GF(4). 44(4), 1369-1387. https://doi.org/10.1109/18.681315
A. Calderbank, P. Shor (1996) Good quantum error-correcting codes exist. 54(2), 1098-1105.
Keith on Notes.
Algorithms GAP - Groups, Programming, ( GAP - Groups, Algorithms, and Programming. https://www.gap-system.org
Ted Hurley, Donny Hurley (2018) Coding theory: the unit-derived methodology. 5(1), 55-80.
Barry Hurley, Ted Hurley (2014) Systems of mds codes from units and idempotents. 335, 81-91.
Ted Hurley, Donny Hurley, Barry Hurley (1806) Entanglement-assisted quantum errorcorrecting codes from units.
Paul Hurley, Ted Hurley (2009) Codes from zero-divisors and units in group rings. 1(1), 57. https://doi.org/10.1504/ijicot.2009.024047
Ted Hurley (1901) Linear complementary dual, maximum distance separable codes.
Paul Hurley, Ted Hurley (2010) BLOCK CODES FROM MATRIX AND GROUP RINGS. 5, 159-194.
T. Hurley, D. Hurley, B. Hurley (2018) Quantum error-correcting codes: the unit design strategy. 5(2), 169-182.
R. Pellikaan (1992) On decoding by error location and dependent sets of error positions. 106, 369-381.
T. Hurley (2016) Convolutional codes from unit schemes.
Ted Hurley (2017) Solving underdetermined systems with error-correcting codes. 4(4), 201. https://doi.org/10.1504/ijicot.2017.086886
Paul Hurley, Ted Hurley (2007) Module Codes in Group Rings. 2007.
F. MacWilliams, N. Sloane (1977) The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1977.
Robert McEliece (2002) The Theory of Information and Coding. https://doi.org/10.1017/cbo9780511606267
R. McEliece (1978) A public-key cryptosystem based on algebraic coding theory. 114116.
Ashikhmin, Knill (2001) Nonbinary quantum stabilizer codes. 47(7), 3065-3072.
Joachim Rosenthal, Roxana Smarandache (1999) Maximum Distance Separable Convolutional Codes. 10(1), 15-32. https://doi.org/10.1007/s002000050120
Published
2021-09-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.