PROJECT TITLE :
Using the Structure of Subfields in the Construction of Goppa Codes and Extended Goppa Codes
It's shown that for some location sets and a few integral multiple power Galois fields that some new general subclasses of Goppa codes might be outlined that have improved lower bounds to code dimension and minimum distance compared with ordinary Goppa codes. Some previously revealed results are shown to be specific cases of these general subclasses of codes. A replacement subclass of reversible Goppa codes is additionally presented. Examples of code construction for these subclasses, demonstrating the improved code parameters, are presented for each non binary and binary codes.
Did you like this research project?
To get this research project Guidelines, Training and Code... Click Here