On the public citation graph
A New Construction of Algebraic Geometry Codes
0 signed · 30 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 points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1998.0214openalex-snapshot
Construction of Linear Systems on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-642-40663-8_8openalex-snapshot
Generalized AG Codes as Evaluation Codes
inferred← citeshttps://doi.org/10.1007/978-3-642-56755-1_36openalex-snapshot
Applications of Algebraic Curves to Constructions of Codes and Almost Perfect Sequences
inferred← citeshttps://doi.org/10.1007/s00200-004-0155-7openalex-snapshot
On the Bounds of the Bilinear Complexity of Multiplication in Some Finite Fields
inferred← citeshttps://doi.org/10.1007/s10623-004-3993-1openalex-snapshot
Asymptotically Good Codes from Generalized Algebraic-Geometry Codes
inferred← citeshttps://doi.org/10.1016/j.disc.2011.05.014openalex-snapshot
On the classification of algebraic function fields of class number three
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.jpaa.2006.12.001openalex-snapshot
On automorphisms of generalized algebraic-geometry codes
inferred← citeshttps://doi.org/10.1016/j.jpaa.2015.06.004openalex-snapshot
Floor type bound for the minimum distance of generalized algebraic geometric codes
inferred← citeshttps://doi.org/10.1017/cbo9781316106853.010openalex-snapshot
Constructions of block codes from algebraic curves over finite fields
inferred← citeshttps://doi.org/10.1090/s0002-9947-08-04710-7openalex-snapshot
Construction of global function fields from linear codes and vice versa
inferred← citeshttps://doi.org/10.1109/18.796390openalex-snapshot
A generalization of algebraic-geometry codes
inferred← citeshttps://doi.org/10.1109/18.796391openalex-snapshot
Constructing codes from algebraic curves
inferred← citeshttps://doi.org/10.1109/18.850687openalex-snapshot
A class of linear codes with good parameters from algebraic curves
inferred← citeshttps://doi.org/10.1109/isit.2001.936172openalex-snapshot
On the duality of algebraic geometric codes with high degree places
inferred← citeshttps://doi.org/10.1109/isit.2010.5513687openalex-snapshot
Good codes from generalised algebraic geometry codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2177066openalex-snapshot
Euclidean and Hermitian Self-Orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2177068openalex-snapshot
Generalized Algebraic Geometric Codes From Maximal Curves
inferred← citeshttps://doi.org/10.1109/tit.2015.2446489openalex-snapshot
A New Construction of Block Codes From Algebraic Curves
inferred← citeshttps://doi.org/10.1109/tit.2025.3641651openalex-snapshot
Algebraic Geometry Codes for Distributed Matrix Multiplication Using Local Expansions
inferred← citeshttps://doi.org/10.1109/wcins.2010.5541920openalex-snapshot
Improvements on codes in non binary fields using generalised algebraic geometry codes
inferred← citeshttps://doi.org/10.1137/21m1467936openalex-snapshot
Explicit Non-special Divisors of Small Degree, Algebraic Geometric Hulls, and LCD Codes from Kummer Extensions
inferred← citeshttps://doi.org/10.1360/ssm-2019-0321openalex-snapshot
A method of constructing linear mapping families to achieve the asymptotic GV bound
inferred← citeshttps://doi.org/10.14201/gredos.22484openalex-snapshot
A study of convolutional codes. Classification, new families and decoding
inferred← citeshttps://doi.org/10.5772/intechopen.79802openalex-snapshot
Probability, Combinatorics and Control
inferred← citeshttps://doi.org/10.5772/intechopen.88288openalex-snapshot
A Geometrical Realisation of Quasi-Cyclic Codes
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.