SOME SPECIFIC FEATURES IN THE CONSTRUCTION OF P-ARY REED-SOLOMON CODES FOR AN ARBITRARY PRIME P
DOI:
https://doi.org/10.17770/etr2024vol4.8212Keywords:
BCH Codes, Error Correcting Codes, Extended Galois Field, p-ary Reed-Solomon CodesAbstract
The Reed-Solomon (RS) codes, proposed in 1960 by Irving Reed and Gustav Solomon as a subset of error-correcting codes, have many current applications. The most significant of which are data recovery in storage systems, including hard drives, minidiscs, CDs, DVDs, Google's GFS, BigTable, and RAID 6, as well as in communication systems such as DSL, WiMAX, DVB, ATSC, and satellite communications. Additionally, RS codes are used as Bar codes in management and advertising systems, such as PDF-417, MaxiCode, Datamatrix, QR Code, and Aztec Code. Nowadays, RS codes over Galois Fields GF(2m) with base 2 are commonly used in these applications, with the GF(28) field being the most widely used. This allows all 256 values of a byte to be represented as a polynomial with 8 binary coefficients over GF(28). Considering RS codes as cyclic codes in GF(2m) fields, as well as the validity of mathematical dependencies in arbitrary field GF(pm), is a motivation to verify and generalize the idea of generating RS codes in a field with base other prime than 2. As a result, the paper derives the specific features of the construction of Reed-Solomon codes by considering them as a family of codes over any field GF(pm) whose base is a prime p other than 2. The paper also discusses the unique properties of basic arithmetic operations in the arbitrary field GF(pm), which arise from the non-uniqueness of the inverse elements a and -a in a field with base other than 2.
Downloads
References
I. S. Reed and G. Solomon, “Polynomial codes over certain finite fields,” Journal of the Society for Industrial & Applied Mathematics 8, No. 2, pp. 300-304, 1960.
H. Hoeve, J. Timmermans and L. Vries, “3.4 Error Correction and Concealment in Compact Disc Systems, ” in Origins and Successors of the Compact Disc, Contributions of Philips to Optical Storage: Springer Link, 2009, pp. 82.
J. D. Key, “Some error-correcting codes and their applications, ” in Applied Mathematical Modeling: A Multidisciplinary Approach, Chapman & Hall/CRC Press, 1999.
H. Chang, C. Shung and C. Lee, “A Reed–Solomon Product-Code (RS-PC) Decoder Chip for DVD Applications, ” IEEE Journal of Solid-State Circuits, Vol. 36, No. 2, pp. 229-238, February 2001.
X. Liu, H. Jia and C. Ma. “Error-Correction codes For Optical Disc Storage, ” in Advances in Optical Data Storage Technology, Proceedings of SPIE Vol. 5643, pp. 342-347, 2005.
J. A. Lin and C. S. Fuh, “2D Barcode Image Decoding, ” in Mathematical Problems in Engineering, Article ID 848276, 10 pages, 2013. https://doi.org/10.1155/2013/848276 .
A. J. McAuley, “Reliable broadband communication using a burst erasure correcting code. ” in Proceedings of the ACM symposium on Communications architectures & protocols, pp. 297-306, ACM, 1990, https://dl.acm.org/doi/pdf/10.1145/99508.99566 .
H. -C. Lee, J. -H. Wu, C. -H. Wang and Y. -L. Ueng, "A Graph-Based Soft-Decision Decoding Scheme for Reed-Solomon Codes," in IEEE Journal on Selected Areas in Information Theory, vol. 4, pp. 420-433, 2023, https://doi.org/10.1109/JSAIT.2023.3315453 .
Y.Chen, “Thermal Management and Data Archiving in Data Centers,” Ph.D. thesis, Auburn University, Auburn, Alabama, 2016.
T. N. Hewage, M. N. Halgamuge, A. Syed, and G. Ekici, “Big data techniques of Google, Amazon, Facebook and Twitter. ” in Journal of Communications Vol. 13, No. 2, pp. 94-100, February 2018.
A. Chiniah and A.Mungur, “On the Adoption of Erasure Code for Cloud Storage by Major Distributed Storage Systems,” in EAI Endorsed Transactions on Cloud Systems, 7(21), e1-e11, 2022.
H.-U. Kim and J.-K. Kang, “High-speed Serial Interface using PWAM Signaling Scheme,” in 19th International SoC Design Conference (ISOCC), Gangneungsi, Korea, pp. 255-256, 2022, https://doi.org/10.1109/ISOCC56007.2022.10031330 .
N. Stojanović, C. Prodaniuc, Z. Liang, J. Wei, S. Calabró, T. Rahman and C. Xie, “4D PAM-7 Trellis Coded Modulation for Data Centers,” in IEEE Photonics Technology Letters, Vol. 31, No. 5, pp. 369-372, 1 March 2019, https://doi.org/10.1109/LPT.2019.2895686 .
K. Matheus and T. Königseder, Automotive Ethernet. Cambridge University Press, 2021.
S. Nabipour and M. Gholizade, Arithmetic Operators over Finite Field GF (2m) in BCH and Reed-Solomon Codes, arXiv preprint arXiv:2310.12319. 2023, [Online]. Available: https://arxiv.org/ftp/arxiv/papers/2310/2310.12319.pdf. [Accessed: Jan. 7, 2024].
R. C. Bose and D.K. Ray-Chaudhuri. “On a class of error correcting binary group codes,” in Information and Control, Volume 3, Issue 1, pp. 68–79, March 1960.
N.Atti, G. Diaz–Toca and H. Lombardi, The Berlekamp-Massey Algorithm revisited, in Applicable Algebra in Engineering, Communication and Computing 17(1), pp. 75–82, 2006, https://doi.org/10.1007/s00200-005-0190-z .
J. A. M.Naranjo, J. A. López-Ramos and L. G. Casado, “Applications of the extended Euclidean algorithm to privacy and secure communications, ” in Proceedings of the 10th International Conference on Computational and Mathematical Methods in Science and Engineering, CMMSE 2010, pp. 27–30, June 2010.
A. Beletsky, “An Effective Algorithm for the Synthesis of Irreducible Polynomials over a Galois Fields of Arbitrary Characteristics,” in WSEAS Transactions on Mathematics 20, pp. 508-519, 2021.
Downloads
Published
Issue
Section
License
Copyright (c) 2024 Zhaneta Savova, Rosen Bogdanov
This work is licensed under a Creative Commons Attribution 4.0 International License.
