I’ve recently been revisiting older mathematical papers with the help of AI, checking proofs, correcting errors, and looking for conclusions that were not apparent when the papers were written. Years ago I worked on symmetric objects in the theory of error-correcting codes and had the opportunity to teach coding theory at the Naval Academy. But I fell in love with a different topic, symmetric objects in graph theory, and stopped thinking about codes as an object of research. I’m learning to fall back in love with those old objects again.
For quadratic residue codes, the relationship with hyperelliptic curves gives a good example of how one topic can connect with a totally different one – the unity of mathematics. The connection comes from curves of the form
where is a nonempty subset of the finite field
. Remarkably, the number of rational points on these curves is closely related to the weights of codewords in certain binary linear codes, called quasi-quadratic residue (QQR) codes. This means that a problem about constructing good codes can be translated into a problem about counting solutions to polynomial equations.
About 20 years ago I wrote a paper, “On quadratic residue codes and hyperelliptic curves” (published in Discrete Mathematics & Theoretical Computer Science 10 (2008), pdf here) to dive into that topic more. I had more questions than answers. Recall Goppa’s conjecture is that the binary asymptotic Gilbert-Varshamov bound is best possible for any family of binary codes. The asymptotic GV bound states that the rate of any binary linear block code
is greater than or equal to
, where
A refinement of the Bazzi-Mitter conjecture is given below and is still open.
Conjecture. There is a constant c < 2 such that for infinitely many primes p ≡ ±3 (mod 8).
(a) This is equivalent to: the quaternary quadratic residue codes of length p have minimum distance for some fixed
, for infinitely many such p.
(b) If it holds with (which is about 1.779), then Goppa’s conjecture is false.
Now, 20 years later, I’d like to know what AI thinks of the questions and conjectures in that paper. The result is the AI-aided updated and revised version (2026 pdf here), all my questions were answered by Claude but the conjectures remain open.
Conjectural permutation decoding of some AG codes, revisited
In a related paper, “Conjectural permutation decoding of some AG codes” (ACM SIGSAM Bull. 39(1) (2005)26–32, pdf here), I tried to exploit the large automorphism group of the hyperelliptic curve over a finite field to construct good decoding methods for the associated Goppa code. The basic idea is that by permuting the coordinates of a received codeword message, with possible errors in transmission, to permute its error coordinates out of a chosen information set, making decoding simpler.
Open Question: How many errors can a given automorphism group guarantee to correct by permutation decoding, and how does the answer depend on the information set?
The original paper had two conjectures that addressed the above open question. (The conjectures are technical to state but see the original paper for details.) When I asked AI to referee this paper, ChatGPT and Claude showed both conjectures were false and provided specific counterexamples. They also corrected some sloppy writing on my part and the AI-aided revised paper is much better (pdf here). Again, it was a pleasure using one to referee the other while I was able to add or subtract material to improve readability and correctness. For more details, see the github README for that repo.



You must be logged in to post a comment.