I‑AIMS Institute for Artificial Intelligence
and Mathematical Sciences
/

On the automorphism groups of some AG-codes based on C_{a,b} curves

Tanush Shaska, Quanlong Wang

I-AIMS paper 2006-1 · Published in Serdica J. Comput. 1 (2007), 193–206 · 2007

We study C_(a,b) curves and their applications to coding theory. Recently, Joyner and Ksir have suggested a decoding algorithm based on the automorphisms of the code. We show how C_(a,b) curves can be used to construct MDS codes and focus on some C_(a,b) curves with extra automorphisms, namely y³ = x⁴ + 1, y³ = x⁴ − x, y³ − y = x⁴. The automorphism groups of such codes are determined in most characteristics.

MSC classes: Primary 11T71, 14G50; Secondary 94A05, 14Q05

PDF

References

  1. J. Denef, F. Vercauteren, Counting points on Ca,b curves using Monsky-Washnitz cohomology, (preprint)
  2. [GAP] The GAP Group, GAP – Groups, Algorithms, and Programming, Version 4.4; 2006, (http://www.gap-system.org).
  3. D. Joyner, Conjectural permutation decoding of some AG codes. SIGSAM Bull. 39 (2005), no. 1, 26–32.
  4. D. Joyner and A. Ksir, David Joyner and Amy Ksir , ”Automorphism Groups of Some AG Codes”, IEEE Tran. Information Theory, VOL. 52, NO. 7, July 2006, pp.3325-3329
  5. K. Magaard, T. Shaska, S. Shpectorov, and H. Völklein, The locus of curves with prescribed automorphism group. Communications in arithmetic fundamental groups (Kyoto, 1999/2001). S¯urikaisekikenky¯usho K¯oky¯uroku No. 1267 (2002), 112–141.
  6. T. Shaska, Automorphism groups of genus 3 curves over finite fields, (work in progress).
  7. T. Shaska and J. Thompson, On the generic curves of genus 3, Contemporary. Math., Vol. 369, pg. 233-244, AMS, 2005.
  8. T. Shaska, Quantum codes from algebraic curves with automorphisms, Proceedings of the International Conferences on Complex Systems, Kazimerz-Dolny, 2005, 2006. Journal of Condensed Matter, (to appear).
  9. T. Shaska and H. Völklein, Elliptic subfields and automorphisms of genus two fields, Algebra, Arithmetic and Geometry with Applications. Papers from Shreeram S. Abhyankar’s 70th Birthday Conference, pg. 687 - 707, Springer (2004).
  10. T. Shaska and S. Wijesiri, Codes over rings of size four, Hermitian lattices, and corresponding theta functions, Proc. Amer. Math. Soc., 2008, (to appear)
  11. H. Stichtenoth, Algebraic function fields and codes, Springer: Berlin, 1993.
  12. Chao-Ping Xing, “Hyperelliptic function fields and codes”, Journal of Pure and Applied Algebra, vol. 74, pp. 109-118, 1991.
  13. C. Xing, “On automorphism groups of the Hermitian codes,” IEEE Trans. Inform. Theory, vol. 41, pp. 1629C1635, Nov. 1995.
  14. A. Vardy, “Algorithmic complexity in coding theory and the minimum distance problem”, STOC ’97, pp. 92-109, 1997
  15. S. Wesemeyer, “On the automorphism group of various Goppa codes,” IEEE Trans. Inform. Theory, vol. 44, pp. 630C643, Mar. 1998.

All preprints