Narrow Results

This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n=x^m+x$. We investigate algebraic geometric and quantum stabilizer codes associated with these maximal curves and propose modifications to improve their parameters. The theoretical analysis is complemented by extensive simulation results, which validate the performance of these codes under various error rates. We provide concrete examples of the constructed codes, comparing them with known results to highlight their strengths and trade-offs. The simulation data, presented through detailed graphs and tables, offers insights into the practical behavior of these codes in noisy environments. Our findings demonstrate that while the constructed codes may not always achieve optimal minimum distances, they offer systematic construction methods and interesting parameter trade-offs that could be valuable in specific applications or for further theoretical study.

It is very well known that algebraic structures have valuable applications in the theory of error-correcting codes. Blake [Codes over certain rings, Inform. and Control 20 (1972) 396–404] has constructed cyclic codes over ℤ_m and in [Codes over integer residue rings, Inform. and Control 29 (1975), 295–300] derived parity check-matrices for these codes. In [Linear codes over finite rings, Tend. Math. Appl. Comput. 6(2) (2005) 207–217]. Andrade and Palazzo present a construction technique of cyclic, BCH, alternant, Goppa and Srivastava codes over a local finite ring B. However, in [Encoding through generalized polynomial codes, Comput. Appl. Math.  30(2) (2011) 1–18] and [Constructions of codes through semigroup ring and encoding, Comput. Math. Appl. 62 (2011) 1645–1654], Shah et al. extend this technique of constructing linear codes over a finite local ring B via monoid rings , where p = 2 and k = 1, 2, respectively, instead of the polynomial ring B[X]. In this paper, we construct these codes through the monoid ring , where p = 2 and k = 1, 2, 3. Moreover, we also strengthen and generalize the results of [Encoding through generalized polynomial codes, Comput. Appl. Math.30(2) (2011) 1–18] and [Constructions of codes through semigroup ring ] and [Encoding, Comput. Math. Appl.62 (2011) 1645–1654] to the case of k = 3.

Let B[X; S] be a monoid ring with any fixed finite unitary commutative ring B and is the monoid S such that b = a + 1, where a is any positive integer. In this paper we constructed cyclic codes, BCH codes, alternant codes, Goppa codes, Srivastava codes through monoid ring . For a = 1, almost all the results contained in [16] stands as a very particular case of this study.