Application of Coding Theory in Field 5
Article Sidebar
Main Article Content
Abstract
The main aim of this paper introduce the relationship between the topic of coding theory and the projective plane of order five where special points were found in field 5, which is 31 points, in addition to 31 straight lines, and by applying the theorem that gives the number 1 for the point that lies on the straight line and the number 0 for the point that does not lie on the straight line, we get the code n = 31, d = 6, e = 2, from which we get the table m, v, n. ,n,h, and based on these tables, the distance difference between the code elements was found, where the minimum distance was 6 and the largest distance was 31. These values were used to test the optimality of the code. We can generalize this theorem and apply it to larger fields such as 21 or 23 and others, test their ideality, and find the difference between field 5 and the rest of the fields. M is the maximum value of the size of code over the finite field of order five and an incidence matrix with the parameters, n (length of code), d(minimum distance of code ), and e (error-correcting of code)have been constructed some example and theorem have been given.
Downloads
Article Details
This work is licensed under a Creative Commons Attribution 4.0 International License.
References
Al-Zangana EB, Shehab EA. Certain Types of Linear Codes over the Finite Field of Order Twenty-Five. Iraqi Journal of Science. 2021 Nov 30:4019-31. https://doi.org/10.24996/ijs.2021.62.11.22.
Abdullah HH, Yahya NY. New Applications of Coding Theory in The Projective Space of Order Three. Zanco Journal of Pure and Applied Sciences. 2022 Dec 22;34(s6):119-24. https://doi.org/10.31972/ticma2022.
Hirschfield JWP. Projective Geometries over finite fields. Oxford Claren-don Press, New York,Oxford University Press,1979.
Khalaf AM, Yahya NY. New examples in coding theory for construction optimal linear codes related with weight distribution. InAIP Conference Proceedings 2023 Sep 13 (Vol. 2845, No. 1). AIP Publishing. https://doi.org/10.1063/5.0170590 .
Hirschfeld JW. Projective geometries over finite fields. Oxford University Press; 1998 Jan 8..
Younis AA, Yahya NY. The construction (k+ 1; n)-arcs and (k+ 2; n)-arcs from incomplete (k; n)-arc in PG (3, q). Palestine Journal of Mathematics. 2023 Jan 2;12.
Radhi JS, Al-Zangana EB. Complete (k, r)-Caps From Orbits In PG (3, 11). Iraqi Journal of Science. 2023 Jan 30:347-53. https://doi.org/10.24996/ijs.2023.64.1.32 .
Khalaf HM, Yahya NY. A Geometric Construction of (Ƙ, r)-cap in PG (3, q) for q prime, 2≤ q≤ 997. InJournal of Physics: Conference Series 2022 Aug 1 (Vol. 2322, No. 1, p. 012043). IOP Publishing..
Al-Seraji NA. The Geometry of the Plan of Order Seventeen and Its Application to Error-correcting Codes (Doctoral dissertation, University of Sussex).
AL-Seraji NA, AL-Humaidi RI. Some application of coding theory in the projective plane of order three. Iraqi Journal of Science. 2018 Oct 31:1947-51. https://doi.org/:10.24996/ijs.2018.59.4A.18.
AL-Seraji NA, Ajaj HL. Some Applications of Coding Theory in the Projective Plane of Order Four. Al-Mustansiriyah Journal of Science. 2019 Aug 15;30(1):152-7.
AL-Mukhtar A.SH. Complete Arcs and Surfaces in three-Dimensional Projective Space over Galois Field,PHD.Thesis University of Technology,Iraq,2008.
Hill R. A first course in coding theory. Oxford University Press; 1986.
Al-Zangana EB. The geometry of the plane of order nineteen and its application to error-correcting codes (Doctoral dissertation, University of Sussex).
Al-Seraji NA. Generalized of Optimal Codes. Al-Mustansiriyah Journal of Science. 2013;24(6):101-8.
Al-seraji N. On Almost Maximum Distance Separable Codes. Iraqi Journal of Science. 2013;54(3):638-41.