On the public citation graph

Algebraic-geometry codes with asymptotic parameters better than the Gilbert-Varshamov and the Tsfasman-Vladut-Zink bounds

0 signed · 29 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/mana.19821090103openalex-snapshot
Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
inferredcites →https://doi.org/10.1002/mana.19981950110openalex-snapshot
Towers of Global Function Fields with Asymptotically Many Rational Places and an Improvement on the Gilbert ‐ Varshamov Bound
inferredcites →https://doi.org/10.1007/3-540-15991-6openalex-snapshot
Nearby Molecular Clouds
inferredcites →https://doi.org/10.1007/978-3-540-76878-4openalex-snapshot
Algebraic Function Fields and Codes
inferredcites →https://doi.org/10.1007/978-94-011-3810-9openalex-snapshot
Algebraic-Geometric Codes
inferredcites →https://doi.org/10.1007/bfb0087998openalex-snapshot
On the gonality of curves, abundant codes and decoding
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_2openalex-snapshot
FUNCTION FIELDS OVER FINITE FIELDS AND THEIR APPLICATIONS TO CRYPTOGRAPHY
inferred← citeshttps://doi.org/10.1007/978-3-642-10868-6_16openalex-snapshot
Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-22792-9_39openalex-snapshot
The Torsion-Limit for Algebraic Function Fields and Its Application to Arithmetic Secret Sharing
inferred← citeshttps://doi.org/10.1007/s10623-009-9289-8openalex-snapshot
On improved asymptotic bounds for codes from global function fields
inferred← citeshttps://doi.org/10.1007/s11425-006-0852-8openalex-snapshot
Nonlinear codes with asymptotic parameters better than the Gilbert-Varshamov and the Xing Bounds
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.11.004openalex-snapshot
Further improvements on asymptotic bounds for codes using distinguished divisors
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.010openalex-snapshot
Constructions of block codes from algebraic curves over finite fields
inferred← citeshttps://doi.org/10.1109/18.979330openalex-snapshot
Improvements on parameters of one-point AG codes from Hermitian curves
inferred← citeshttps://doi.org/10.1109/tit.2002.804111openalex-snapshot
Asymptotic bounds on frameproof codes
inferred← citeshttps://doi.org/10.1109/tit.2004.838351openalex-snapshot
Goppa geometric codes achieving the Gilbert-Varshamov bound
inferred← citeshttps://doi.org/10.1109/tit.2005.847735openalex-snapshot
Improvement on Parameters of Goppa Geometry Codes From Maximal Curves Using the VlĂduŢ–Xing Method
inferred← citeshttps://doi.org/10.1109/tit.2005.856977openalex-snapshot
Excellent Nonlinear Codes From Algebraic Function Fields
inferred← citeshttps://doi.org/10.1109/tit.2006.890722openalex-snapshot
A Note on Further Improvements of the TVZ-Bound
inferred← citeshttps://doi.org/10.1109/tit.2008.2008123openalex-snapshot
Improvements on Parameters of Algebraic-Geometry Codes From Hermitian Curves
inferred← citeshttps://doi.org/10.1109/tit.2011.2118191openalex-snapshot
Asymptotically Good Nonlinear Codes From Algebraic Curves
inferred← citeshttps://doi.org/10.1109/tit.2014.2314099openalex-snapshot
Torsion Limits and Riemann-Roch Systems for Function Fields and Applications
inferred← citeshttps://doi.org/10.1109/tit.2016.2609389openalex-snapshot
New Bounds and Constructions for Multiply Constant-Weight Codes
inferred← citeshttps://doi.org/10.1109/wicom.2008.363openalex-snapshot
More Goppa Geometric Codes Achieving the Gilbert-Varshamov Bound
inferred← citeshttps://doi.org/10.1137/060674478openalex-snapshot
Improved Asymptotic Bounds for Codes Using Distinguished Divisors of Global Function Fields
inferred← citeshttps://doi.org/10.1142/9789812794017_0005openalex-snapshot
Asymptotically Good Codes
inferred← citeshttps://doi.org/10.1201/b14977-11openalex-snapshot
Authentication Codes
inferred← citeshttps://doi.org/10.4064/aa105-3-5openalex-snapshot
Constructions of digital nets using global function fields
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.