Automorphism groups of generalized Reed-Solomon codes

Simple item page
dc.creatorJoyner, David
dc.creatorKsir, Amy
dc.creatorTraves, Will
dc.date2008-01-25
dc.date.accessioned2026-07-07T08:56:32Z
dc.date.available2026-07-07T08:56:32Z
dc.descriptionWe look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We (re)classify those finite groups that can arise as the automorphism group of an AG code for the projective line and give an explicit description of how these groups appear. We also give examples of generalized Reed-Solomon codes with large automorphism groups G, such as G=PSL(2,q), and explicitly describe their G-module structure.
dc.description11 pages. Appeared in Advances in coding theory and cryptology, (T. Shaska, W. C. Huffman, D. Joyner, V. Ustimenko, editors), World Scientific, 2007
dc.identifierhttps://arxiv.org/abs/0801.4007
dc.identifierhttp://arxiv.org/abs/0801.4007
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/146648
dc.subjectAlgebraic Geometry
dc.subjectCombinatorics
dc.subject94B27;11T71
dc.titleAutomorphism groups of generalized Reed-Solomon codes
dc.typetext

Files

Collections

arXiv