Abstract
For an arbitrary algebrogeometric code and its dual, error-correcting pairs are explicitly calculated. Such a pair consists of codes that are necessary for an efficient decoding algorithm for a given code. The type of pairs depends on the powers of the divisors, with the help of which both the source code and one of the codes included in the pair are constructed. For an algebraic geometric code CL(D, G) of length and associated with a functional field F/Fq of genus g, pairs correcting t = ⌊(n - deg( G) - g - 1)/2⌋ errors, under certain restrictions on the degrees of divisors involved in their construction, are pairs of codes (Cl(D,F),Cl(D,G + F)⊥) or (CL(D,F⊥),Cl(D,F - G)). Restrictions on the degrees of divisors of codes (CL(D,F), CL(D,G - F)) constituting a pair correcting t = ⌊(deg( G) - 3g + 1)/2⌋ errors for the dual code CL(D, G)⊥) Cases where one of the codes involved in constructing a pair belongs to class of MDS codes and the parameters under which this situation is possible are derived. In addition, possible bounds for the divisors involved in the construction of error-correcting pairs for the subfield subcodes CL(D,G)|fp and CL< are calculated /sub>(D, G)⊥)|Fp of the original algebrogeometric code and its dual, with the expansion degree m = 2 (Fq = Fp2).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
