On the public citation graph
A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vladut bound
0 signed · 330 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.
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.
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.1007/978-3-540-76878-4openalex-snapshot
Algebraic Function Fields and Codes
inferredcites →https://doi.org/10.1007/bf01083182openalex-snapshot
Number of points of an algebraic curve
inferredcites →https://doi.org/10.1007/bf02105859openalex-snapshot
Holomorphic supergeometry and Yang-Mills superfields
inferredcites →https://doi.org/10.1016/0022-314x(92)90079-5openalex-snapshot
Algebraic curves over F2 with many rational points
inferredcites →https://doi.org/10.1016/0022-4049(93)90164-oopenalex-snapshot
Multiple Kummer extension and the number of prime divisors of degree one in function fields
inferredcites →https://doi.org/10.1017/cbo9780511608766openalex-snapshot
Algebraic Curves over Finite Fields
inferredcites →https://doi.org/10.1070/im1983v021n01abeh001641openalex-snapshot
ALGEBRAICO-GEOMETRIC CODES
inferredcites →https://doi.org/10.1515/crll.1994.457.185openalex-snapshot
A characterization of Hermitian function fields over finite fields.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://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
inferred← citeshttps://doi.org/10.1006/ffta.1996.0016openalex-snapshot
Low-Discrepancy Sequences and Global Function Fields with Many Rational Places
inferred← citeshttps://doi.org/10.1006/ffta.1997.0185openalex-snapshot
On Towers and Composita of Towers of Function Fields over Finite Fields
inferred← citeshttps://doi.org/10.1006/ffta.1998.0217openalex-snapshot
Weierstrass Semigroups in an Asymptotically Good Tower of Function Fields
inferred← citeshttps://doi.org/10.1006/ffta.1998.0241openalex-snapshot
Codes on Fibre Products of Some Kummer Coverings
inferred← citeshttps://doi.org/10.1006/ffta.1999.0255openalex-snapshot
Curves with Many Points and Multiplication Complexity in Any Extension of Fq
inferred← citeshttps://doi.org/10.1006/ffta.1999.0274openalex-snapshot
Decoding Algebraic Geometry Codes by a Key Equation
inferred← citeshttps://doi.org/10.1006/ffta.2000.0336openalex-snapshot
A Note on Tamely Ramified Towers of Global Function Fields
inferred← citeshttps://doi.org/10.1006/ffta.2001.0319openalex-snapshot
Singularities of the Modular Curve
inferred← citeshttps://doi.org/10.1006/jabr.2001.9081openalex-snapshot
Curves of Every Genus with Many Points, I: Abelian and Toric Families
inferred← citeshttps://doi.org/10.1006/jnth.1996.0147openalex-snapshot
On the Asymptotic Behaviour of Some Towers of Function Fields over Finite Fields
inferred← citeshttps://doi.org/10.1006/jnth.2000.2642openalex-snapshot
Invariants of Some Algebraic Curves Related to Drinfeld Modular Curves
inferred← citeshttps://doi.org/10.1006/jnth.2002.2804openalex-snapshot
Coverings of Curves with Asymptotically many Rational Points
inferred← citeshttps://doi.org/10.1006/jsco.2000.0372openalex-snapshot
Finding a Basis of a Linear System with Pairwise Distinct Discrete Valuations on an Algebraic Curve
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4openalex-snapshot
Topics in Geometry, Coding Theory and Cryptography
inferred← citeshttps://doi.org/10.1007/1-4020-5334-4_1openalex-snapshot
EXPLICIT TOWERS OF FUNCTION FIELDS OVER FINITE FIELDS
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/11586821_3openalex-snapshot
Improved Decoding of Interleaved AG Codes
inferred← citeshttps://doi.org/10.1007/11617983_10openalex-snapshot
On Constructing AG Codes Without Basis Functions for Riemann-Roch Spaces
inferred← citeshttps://doi.org/10.1007/3-540-45455-1_30openalex-snapshot
New Optimal Tame Towers of Function Fields over Small Finite Fields
inferred← citeshttps://doi.org/10.1007/3-540-45624-4_14openalex-snapshot
Constructions of Codes from Number Fields
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_6openalex-snapshot
Curves with Many Points and Their Applications
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_38openalex-snapshot
Coding Constructions for Blacklisting Problems without Computational Assumptions
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_54openalex-snapshot
Ray class field constructions of curves over finite fields with many rational points
inferred← citeshttps://doi.org/10.1007/3-540-61581-4_69openalex-snapshot
Algebraic geometry lattices and codes
inferred← citeshttps://doi.org/10.1007/978-1-4615-5121-8_3openalex-snapshot
Improved Hermitian-like Codes over GF(4)
inferred← citeshttps://doi.org/10.1007/978-1-4615-5121-8_6openalex-snapshot
Curves, Codes and Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-05378-9_20openalex-snapshot
Secure Computation with Constant Communication Overhead Using Multiplication Embeddings
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_18openalex-snapshot
Blackbox Secret Sharing Revisited: A Coding-Theoretic Approach with Application to Expansionless Near-Threshold Schemes
inferred← citeshttps://doi.org/10.1007/978-3-030-64381-2_16openalex-snapshot
On the Complexity of Arithmetic Secret Sharing
inferred← citeshttps://doi.org/10.1007/978-3-030-64840-4_6openalex-snapshot
Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over $$\mathbb {Z}/p^k\mathbb {Z} $$
inferred← citeshttps://doi.org/10.1007/978-3-031-22318-1_13openalex-snapshot
Leakage-resilient Linear Secret-sharing Against Arbitrary Bounded-size Leakage Family
inferred← citeshttps://doi.org/10.1007/978-3-031-22944-2_3openalex-snapshot
Polynomial Constructions of Chudnovsky-type Algorithms for Multiplication in Finite Fields with Linear Bilinear Complexity
inferred← citeshttps://doi.org/10.1007/978-3-031-38545-2_6openalex-snapshot
Succinct Arguments for RAM Programs via Projection Codes
inferred← citeshttps://doi.org/10.1007/978-3-032-35367-2_10openalex-snapshot
Chosen Ciphertext Secure Pseudorandom Codes in the Standard Model
inferred← citeshttps://doi.org/10.1007/978-3-0348-7865-4openalex-snapshot
Coding, Cryptography and Combinatorics
inferred← citeshttps://doi.org/10.1007/978-3-0348-7865-4_3openalex-snapshot
Modularity of Asymptotically Optimal Towers of Function Fields
inferred← citeshttps://doi.org/10.1007/978-3-0348-8266-8_14openalex-snapshot
Explicit Towers of Drinfeld Modular Curves
inferred← citeshttps://doi.org/10.1007/978-3-0348-8266-8_16openalex-snapshot
Asymptotically Good Towers of Global Fields
inferred← citeshttps://doi.org/10.1007/978-3-0348-8266-8_17openalex-snapshot
Explicit Constructions of Towers of Function Fields with Many Rational Places
inferred← citeshttps://doi.org/10.1007/978-3-0348-8266-8_18openalex-snapshot
Curves over Finite Fields and Codes
inferred← citeshttps://doi.org/10.1007/978-3-319-40189-8_7openalex-snapshot
Secret Sharing Schemes with Algebraic Properties and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-96878-0_14openalex-snapshot
Amortized Complexity of Information-Theoretically Secure MPC Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_12openalex-snapshot
Everywhere Ramified Towers of Global Function Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_13openalex-snapshot
On the Construction of Some Towers over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-540-74496-2_37openalex-snapshot
A New Lower Bound on the t-Parameter of (t, s)-Sequences
inferred← citeshttps://doi.org/10.1007/978-3-642-14165-2_47openalex-snapshot
Improved Constructions for Non-adaptive Threshold Group Testing
inferred← citeshttps://doi.org/10.1007/978-3-642-18487-1_21openalex-snapshot
Asymptotically Optimal Towers of Curves over Finite Fields
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/978-3-642-56478-9_58openalex-snapshot
Error-Correcting Codes and Curves over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_16openalex-snapshot
Codes on Drinfeld Modular Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_9openalex-snapshot
Skew Pyramids of Function Fields Are Asymptotically Bad
inferred← citeshttps://doi.org/10.1007/978-3-642-59435-9_11openalex-snapshot
On Curves with Many Rational Points over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-662-54388-7_13openalex-snapshot
On the Computational Overhead of MPC with Dishonest Majority
inferred← citeshttps://doi.org/10.1007/978-94-010-1011-5_8openalex-snapshot
Coding Theory and Algebraic Curves Over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-981-99-8721-4_4openalex-snapshot
Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications
inferred← citeshttps://doi.org/10.1007/978-981-99-8721-4_7openalex-snapshot
Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols
inferred← citeshttps://doi.org/10.1007/b104335openalex-snapshot
List Decoding of Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/bf02399198openalex-snapshot
Asymptotic properties of zeta-functions
inferred← citeshttps://doi.org/10.1007/bf02876039openalex-snapshot
Parameters of the codes over affine varieties
inferred← citeshttps://doi.org/10.1007/s00145-024-09509-2openalex-snapshot
The Price of Active Security in Cryptographic Protocols
inferred← citeshttps://doi.org/10.1007/s00200-008-0075-zopenalex-snapshot
Asymmetric information embedding
inferred← citeshttps://doi.org/10.1007/s00200-022-00576-1openalex-snapshot
A note on subtowers and supertowers of recursive towers of function fields
inferred← citeshttps://doi.org/10.1007/s002009900017openalex-snapshot
A Propagation Rule for Linear Codes
inferred← citeshttps://doi.org/10.1007/s00208-020-02039-9openalex-snapshot
Good recursive towers over prime fields exist
inferred← citeshttps://doi.org/10.1007/s00453-013-9754-7openalex-snapshot
Improved Constructions for Non-adaptive Threshold Group Testing
inferred← citeshttps://doi.org/10.1007/s00453-022-01000-3openalex-snapshot
Monotone Circuit Lower Bounds from Robust Sunflowers
inferred← citeshttps://doi.org/10.1007/s00454-020-00261-5openalex-snapshot
On the Lattice Hadwiger Number of Superballs and Some Other Bodies
inferred← citeshttps://doi.org/10.1007/s00574-004-0008-9openalex-snapshot
On towers of function fields of Artin-Schreier type
inferred← citeshttps://doi.org/10.1007/s00574-005-0046-yopenalex-snapshot
A Class of Artin-Schreier Towers with Finite Genus
inferred← citeshttps://doi.org/10.1007/s00574-010-0026-8openalex-snapshot
The Hasse-Witt invariant in some towers of function fields over finite fields
inferred← citeshttps://doi.org/10.1007/s00574-013-0008-8openalex-snapshot
Curves of every genus with a prescribed number of rational points
inferred← citeshttps://doi.org/10.1007/s006050050036openalex-snapshot
Drinfeld Modules of Rank 1 and Algebraic Curves with Many Rational Points
inferred← citeshttps://doi.org/10.1007/s10623-004-3993-1openalex-snapshot
Asymptotically Good Codes from Generalized Algebraic-Geometry Codes
inferred← citeshttps://doi.org/10.1007/s10623-008-9262-yopenalex-snapshot
Finite field elements of high order arising from modular curves
inferred← citeshttps://doi.org/10.1007/s10623-009-9317-8openalex-snapshot
Parameter choices and a better bound on the list size in the Guruswami–Sudan algorithm for algebraic geometry codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01426-6openalex-snapshot
Bases for Riemann–Roch spaces of linearized function fields with applications to generalized algebraic geometry codes
inferred← citeshttps://doi.org/10.1007/s10623-025-01597-wopenalex-snapshot
Introducing locality in some generalized AG codes
inferred← citeshttps://doi.org/10.1007/s10623-026-01898-8openalex-snapshot
Quantum weighted algebraic geometry codes
inferred← citeshttps://doi.org/10.1007/s10958-006-0119-5openalex-snapshot
Circuit lower bounds and linear codes
inferred← citeshttps://doi.org/10.1007/s11424-007-9002-9openalex-snapshot
Constructive Kissing Numbers in High-Dimensional Spaces
inferred← citeshttps://doi.org/10.1007/s11425-009-0141-4openalex-snapshot
Testing algebraic geometric codes
inferred← citeshttps://doi.org/10.1007/s11464-007-0001-xopenalex-snapshot
Algebraic geometric codes with applications
inferred← citeshttps://doi.org/10.1007/s11856-012-0126-9openalex-snapshot
(2, 1)-Separating systems beyond the probabilistic bound
inferred← citeshttps://doi.org/10.1007/s12095-023-00682-yopenalex-snapshot
Frameproof codes, separable codes and $$B_2$$ codes: Bounds and constructions
inferred← citeshttps://doi.org/10.1007/s40590-025-00746-4openalex-snapshot
Curves with many rational points via Atkin–Lehner involution
inferred← citeshttps://doi.org/10.1016/j.crma.2011.06.016openalex-snapshot
Minorations du nombre de classes des corps de fonctions algébriques définis sur un corps fini
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.038openalex-snapshot
Nonbinary quantum error-correcting codes from algebraic curves
inferred← citeshttps://doi.org/10.1016/j.endm.2013.05.005openalex-snapshot
On the number of rational points of curves over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.04.004openalex-snapshot
Asymptotics for the genus and the number of rational places in towers of function fields over a finite field
inferred← citeshttps://doi.org/10.1016/j.ffa.2005.04.008openalex-snapshot
Error-correcting codes on projective bundles
inferred← citeshttps://doi.org/10.1016/j.ffa.2006.12.004openalex-snapshot
Evaluation codes from order domain theory
inferred← citeshttps://doi.org/10.1016/j.ffa.2007.02.001openalex-snapshot
The Galois closure of the Garcia–Stichtenoth tower
inferred← citeshttps://doi.org/10.1016/j.ffa.2007.05.004openalex-snapshot
On rational embeddings of curves in the second Garcia–Stichtenoth tower
inferred← citeshttps://doi.org/10.1016/j.ffa.2009.04.003openalex-snapshot
A generalization of Baker's theorem
inferred← citeshttps://doi.org/10.1016/j.ffa.2012.05.005openalex-snapshot
Multisequences with large linear and k-error linear complexity from a tower of Artin–Schreier extensions of function fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.09.008openalex-snapshot
Counting curves over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2016.07.008openalex-snapshot
A graph aided strategy to produce good recursive towers over finite fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2021.101909openalex-snapshot
Asymptotically good towers of function fields with small p-rank
inferred← citeshttps://doi.org/10.1016/j.ffa.2026.102866openalex-snapshot
On an analogue of the Ihara constant for exponential sums
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2003.09.031openalex-snapshot
Multiplication algorithm in a finite field and tensor rank of the multiplication
inferred← citeshttps://doi.org/10.1016/j.jco.2011.01.008openalex-snapshot
On the tensor rank of multiplication in any extension of F2
inferred← citeshttps://doi.org/10.1016/j.jco.2012.02.005openalex-snapshot
Bilinear complexity of algebras and the Chudnovsky–Chudnovsky interpolation method
inferred← citeshttps://doi.org/10.1016/j.jco.2019.03.002openalex-snapshot
Accelerated tower arithmetic
inferred← citeshttps://doi.org/10.1016/j.jco.2024.101906openalex-snapshot
Combinatorial constructions of separating codes
inferred← citeshttps://doi.org/10.1016/j.jcta.2014.09.003openalex-snapshot
Optimal rate algebraic list decoding using narrow ray class fields
inferred← citeshttps://doi.org/10.1016/j.jcta.2022.105658openalex-snapshot
Linear cutting blocking sets and minimal codes in the rank metric
inferred← citeshttps://doi.org/10.1016/j.jnt.2003.11.004openalex-snapshot
A tower with non-Galois steps which attains the Drinfeld–Vladut bound
inferred← citeshttps://doi.org/10.1016/j.jnt.2004.05.011openalex-snapshot
Graphs and recursively defined towers of function fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2005.04.009openalex-snapshot
On the existence of non-special divisors of degree g and g-1 in algebraic function fields over Fq
inferred← citeshttps://doi.org/10.1016/j.jnt.2007.06.010openalex-snapshot
On the tensor rank of the multiplication in the finite fields
inferred← citeshttps://doi.org/10.1016/j.jnt.2010.10.006openalex-snapshot
The Galois closure of Drinfeld modular towers
inferred← citeshttps://doi.org/10.1016/j.jnt.2016.07.025openalex-snapshot
A modular interpretation of various cubic towers
inferred← citeshttps://doi.org/10.1016/j.jnt.2020.06.006openalex-snapshot
A modular interpretation of BBGS towers
inferred← citeshttps://doi.org/10.1016/j.jpaa.2004.12.008openalex-snapshot
On the construction of tame towers over finite fields
inferred← citeshttps://doi.org/10.1016/j.jpaa.2017.06.007openalex-snapshot
Tower of algebraic function fields with maximal Hasse–Witt invariant and tensor rank of multiplication in any extension of F2 and F3
inferred← citeshttps://doi.org/10.1016/j.jpaa.2024.107720openalex-snapshot
Seshadri constants and AG codes of vector bundles
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.02.015openalex-snapshot
List decoding algorithm based on voting in Gröbner bases for general one-point AG codes
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.11.045openalex-snapshot
An improvement of the construction of the D.V. and G.V. Chudnovsky algorithm for multiplication in finite fields
inferred← citeshttps://doi.org/10.1016/s0022-314x(02)92804-0openalex-snapshot
Coverings of Curves with Asymptotically many Rational Points,
inferred← citeshttps://doi.org/10.1016/s1071-5797(02)00017-5openalex-snapshot
Sudan-decoding generalized geometric Goppa codes
inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00026-1openalex-snapshot
Low increasing tower of algebraic function fields and bilinear complexity of multiplication in any extension of Fq
inferred← citeshttps://doi.org/10.1016/s1071-5797(03)00038-8openalex-snapshot
Integral closures and weight functions over finite fields
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1017/cbo9781107337756openalex-snapshot
Secure Multiparty Computation and Secret Sharing
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.010openalex-snapshot
Constructions of block codes from algebraic curves over finite fields
inferred← citeshttps://doi.org/10.1023/a:1005794417363openalex-snapshot
Exponential Sums and Coding Theory: A Review
inferred← citeshttps://doi.org/10.1023/b:desi.0000029232.40302.6dopenalex-snapshot
On t-Covering Arrays
inferred← citeshttps://doi.org/10.1070/rm9928openalex-snapshot
On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry
inferred← citeshttps://doi.org/10.1080/03081087.2018.1459448openalex-snapshot
Asymptotically good convolutional codes
inferred← citeshttps://doi.org/10.1081/agb-120003983openalex-snapshot
EXTENSIONS OF ALGEBRAIC FUNCTION FIELDS WITH COMPLETE SPLITTING OF ALL RATIONAL PLACES
inferred← citeshttps://doi.org/10.1081/agb-120003988openalex-snapshot
GENERALIZED GEOMETRIC GOPPA CODES
inferred← citeshttps://doi.org/10.1090/conm/487/09533openalex-snapshot
On the generalizations of the Brauer-Siegel theorem
inferred← citeshttps://doi.org/10.1090/conm/686/13779openalex-snapshot
On some bounds for symmetric tensor rank of multiplication in finite fields
inferred← citeshttps://doi.org/10.1090/conm/770openalex-snapshot
Arithmetic, Geometry, Cryptography and Coding Theory
inferred← citeshttps://doi.org/10.1090/conm/770/15431openalex-snapshot
Toward good families of codes from towers of surfaces
inferred← citeshttps://doi.org/10.1090/conm/832/16605openalex-snapshot
Multiplication in finite fields with Chudnovsky-type algorithms over the projective line
inferred← citeshttps://doi.org/10.1090/conm/832/16606openalex-snapshot
Explicit Riemann-Roch spaces in the Hilbert class field
inferred← citeshttps://doi.org/10.1090/mcom/3230openalex-snapshot
Arithmetic in finite fields based on the Chudnovsky-Chudnovsky multiplication algorithm
inferred← citeshttps://doi.org/10.1090/s0002-9939-09-09888-8openalex-snapshot
A constructive bound on kissing numbers
inferred← citeshttps://doi.org/10.1090/s0025-5718-07-02012-1openalex-snapshot
Correlated algebraic-geometric codes: Improved list decoding over bounded alphabets
inferred← citeshttps://doi.org/10.1090/s0025-5718-2015-02921-4openalex-snapshot
New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields
inferred← citeshttps://doi.org/10.1090/tran/9205openalex-snapshot
Strong blocking sets and minimal codes from expander graphs
inferred← citeshttps://doi.org/10.1109/18.476212openalex-snapshot
Algebraic function fields over finite fields with many rational places
inferred← citeshttps://doi.org/10.1109/18.567659openalex-snapshot
An explicit construction of a sequence of codes attaining the Tsfasman-Vladut-Zink bound. The first steps
inferred← citeshttps://doi.org/10.1109/18.720549openalex-snapshot
The art of signaling: fifty years of coding theory
inferred← citeshttps://doi.org/10.1109/18.748993openalex-snapshot
List decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.749018openalex-snapshot
Codes on Garcia-Stichtenoth curves with true distance greater than Feng-Rao distance
inferred← citeshttps://doi.org/10.1109/18.771252openalex-snapshot
On the number of correctable errors of the Feng-Rao decoding algorithm for AG codes
inferred← citeshttps://doi.org/10.1109/18.796393openalex-snapshot
On Weierstrass semigroups and the redundancy of improved geometric Goppa codes
inferred← citeshttps://doi.org/10.1109/18.850688openalex-snapshot
Towers of function fields and iterated means
inferred← citeshttps://doi.org/10.1109/18.923746openalex-snapshot
On the splitting of places in a tower of function fields meeting the Drinfeld-Vladut bound
inferred← citeshttps://doi.org/10.1109/18.945244openalex-snapshot
A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
inferred← citeshttps://doi.org/10.1109/18.945271openalex-snapshot
Finding the defining functions for one-point algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/18.945273openalex-snapshot
Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/ccc.2014.24openalex-snapshot
Hitting Sets for Low-Degree Polynomials with Optimal Density
inferred← citeshttps://doi.org/10.1109/cig.2010.5592905openalex-snapshot
Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?
inferred← citeshttps://doi.org/10.1109/focs.2006.23openalex-snapshot
Correlated Algebraic-Geometric Codes: Improved List Decoding over Bounded Alphabets
inferred← citeshttps://doi.org/10.1109/isit.1997.613348openalex-snapshot
Construction of a new class of codes from generalized Hermitian curves
inferred← citeshttps://doi.org/10.1109/isit.2002.1023331openalex-snapshot
Integral closures and weight functions over finite fields
inferred← citeshttps://doi.org/10.1109/isit.2002.1023333openalex-snapshot
Explicit construction of codes on an asymptotically bad tower of function fields
inferred← citeshttps://doi.org/10.1109/isit.2002.1023476openalex-snapshot
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365113openalex-snapshot
The missing evaluation codes from order domain theory
inferred← citeshttps://doi.org/10.1109/isit.2004.1365583openalex-snapshot
On the zeta functions of two towers of function fields
inferred← citeshttps://doi.org/10.1109/isit.2018.8437791openalex-snapshot
Codes on Curves with Hierarchical Locality
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619101openalex-snapshot
Asymptotic Construction of Locally Repairable Codes with Multiple Recovering Sets
inferred← citeshttps://doi.org/10.1109/itw.1998.706393openalex-snapshot
On the missing functions of Hermitian-like codes over GF(2/sup 2/)
inferred← citeshttps://doi.org/10.1109/itw.1998.706401openalex-snapshot
Trinomial curves with many rational points
inferred← citeshttps://doi.org/10.1109/itw.2015.7133155openalex-snapshot
Powers of codes and applications to cryptography
inferred← citeshttps://doi.org/10.1109/mwscas.2003.1562357openalex-snapshot
Hardware analysis of decoding algorithms for AGC
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959879openalex-snapshot
Coding theory: Tutorial & survey
inferred← citeshttps://doi.org/10.1109/sfcs.2001.959942openalex-snapshot
Expander-based constructions of efficiently decodable codes
inferred← citeshttps://doi.org/10.1109/tcomm.2023.3292293openalex-snapshot
Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules
inferred← citeshttps://doi.org/10.1109/tit.1996.485743openalex-snapshot
Algebraic Function Fields and Codes [Book Reviews]
inferred← citeshttps://doi.org/10.1109/tit.2002.1013156openalex-snapshot
Improvement of Ashikhmin-Litsyn-Tsfasman bound for quantum codes
inferred← citeshttps://doi.org/10.1109/tit.2003.815776openalex-snapshot
List decoding from erasures: bounds and code constructions
inferred← citeshttps://doi.org/10.1109/tit.2004.833367openalex-snapshot
Disjoint Linear Codes From Algebraic Function Fields
inferred← citeshttps://doi.org/10.1109/tit.2006.872986openalex-snapshot
Transitive and self-dual codes attaining the Tsfasman-Vla/spl breve/dut$80-Zink bound
inferred← citeshttps://doi.org/10.1109/tit.2011.2179519openalex-snapshot
Bases for Riemann–Roch Spaces of One-Point Divisors on an Optimal Tower of Function Fields
inferred← citeshttps://doi.org/10.1109/tit.2011.2180696openalex-snapshot
Asymptotic Bound for Multiplication Complexity in the Extensions of Small Finite Fields
inferred← citeshttps://doi.org/10.1109/tit.2014.2300473openalex-snapshot
Fast Decoding of Multipoint 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.2014.2314468openalex-snapshot
Erasure List-Decodable Codes From Random and Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2316531openalex-snapshot
An Improvement of the Gilbert–Varshamov Bound Over Nonprime Fields
inferred← citeshttps://doi.org/10.1109/tit.2015.2503767openalex-snapshot
High-Rate Locally Correctable Codes via Lifting
inferred← citeshttps://doi.org/10.1109/tit.2017.2692212openalex-snapshot
Efficiently List-Decodable Punctured Reed-Muller Codes
inferred← citeshttps://doi.org/10.1109/tit.2017.2700859openalex-snapshot
Locally Recoverable Codes on Algebraic Curves
inferred← citeshttps://doi.org/10.1109/tit.2017.2737881openalex-snapshot
Explicit Construction of AG Codes From a Curve in the Tower of Bassa-Beelen-Garcia-Stichtenoth
inferred← citeshttps://doi.org/10.1109/tit.2017.2773057openalex-snapshot
Algebraic Geometry Codes With Complementary Duals Exceed the Asymptotic Gilbert-Varshamov Bound
inferred← citeshttps://doi.org/10.1109/tit.2017.2773089openalex-snapshot
Repairing Algebraic Geometry Codes
inferred← citeshttps://doi.org/10.1109/tit.2019.2919830openalex-snapshot
Codes With Hierarchical Locality From Covering Maps of Curves
inferred← citeshttps://doi.org/10.1109/tit.2019.2939135openalex-snapshot
Efficient Multi-Point Local Decoding of Reed-Muller Codes via Interleaved Codex
inferred← citeshttps://doi.org/10.1109/tit.2020.2970419openalex-snapshot
Constructive Asymptotic Bounds of Locally Repairable Codes via Function Fields
showing the first 200 of 319 · page through all 319
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.