2026-07-23T20:56:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:27077 2026-07-23T11:36:19Z ddc:004 open_access

Trace Hermitian Codes Have Vanishing Bias Kopparty, Swastik Ta-Shma, Amnon Yakirevitch, Kedem algebraic geometry codes character sums Stepanov method error-correcting codes In this work we give the first proof that Trace Hermitian codes have vanishing bias. This brings to the front the question of understanding the distance of Trace AG codes, and the fascinating possibility that in some variation they might give asymptotically good codes. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Swastik Kopparty and Amnon Ta-Shma and Kedem Yakirevitch 2026 Is Part Of LIPIcs, Volume 383, 41st Computational Complexity Conference (CCC 2026) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CCC.2026.35 urn:nbn:de:0030-drops-270773 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2026.35 eng https://creativecommons.org/licenses/by/4.0/legalcode