On the public citation graph
On the dimension of subfield subcodes
0 signed · 73 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.1016/0097-3165(89)90045-9openalex-snapshot
Which extended goppa codes are cyclic?
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1070/im1983v021n01abeh001641openalex-snapshot
ALGEBRAICO-GEOMETRIC CODES
inferredcites →https://doi.org/10.1090/conm/093/1003354openalex-snapshot
A remark on algebraic geometric codes
inferredcites →https://doi.org/10.1109/tit.1975.1055336openalex-snapshot
Algebraic generalization of BCH-Goppa-Helgert codes
inferredcites →https://doi.org/10.1109/tit.1975.1055435openalex-snapshot
On subfield subcodes of modified Reed-Solomon codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1976.1055610openalex-snapshot
Further results on Goppa codes and their applications to constructing efficient binary codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-6610(2000)8:3<174::aid-jcd3>3.0.co;2-topenalex-snapshot
Quantum twisted codes
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_3openalex-snapshot
ARTIN-SCHREIER EXTENSIONS AND THEIR APPLICATIONS
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_36openalex-snapshot
Quantum Error-Correcting Codes Over Small Fields From AG Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-52969-6_37openalex-snapshot
A Go-Up Code Construction from Linear Codes Yielding Additive Codes for Quantum Stabilizer Codes
inferred← citeshttps://doi.org/10.1007/s10623-004-1722-4openalex-snapshot
Proof of Conjectures on the True Dimension of Some Binary Goppa Codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9628-zopenalex-snapshot
The dimension of subcode-subfields of shortened generalized Reed–Solomon codes
inferred← citeshttps://doi.org/10.1007/s10623-012-9736-9openalex-snapshot
On the subfield subcodes of Hermitian codes
inferred← citeshttps://doi.org/10.1007/s10623-014-0016-8openalex-snapshot
Quantum codes from affine variety codes and their subfield-subcodes
inferred← citeshttps://doi.org/10.1007/s10623-014-9962-4openalex-snapshot
Optimal codes as Tanner codes with cyclic component codes
inferred← citeshttps://doi.org/10.1007/s10623-016-0262-zopenalex-snapshot
On the roots and minimum rank distance of skew cyclic codes
inferred← citeshttps://doi.org/10.1007/s10623-019-00688-9openalex-snapshot
Wei-type duality theorems for rank metric codes
inferred← citeshttps://doi.org/10.1007/s10623-022-01181-6openalex-snapshot
Rank weight hierarchy of some classes of polynomial codes
inferred← citeshttps://doi.org/10.1007/s10623-023-01261-1openalex-snapshot
On subfield subcodes obtained from restricted evaluation codes
inferred← citeshttps://doi.org/10.1007/s10623-024-01360-7openalex-snapshot
Linear codes associated to determinantal varieties in the space of hermitian matrices
inferred← citeshttps://doi.org/10.1007/s11425-013-4633-xopenalex-snapshot
Linear recurring sequences and subfield subcodes of cyclic codes
inferred← citeshttps://doi.org/10.1016/0166-218x(91)90116-eopenalex-snapshot
The parameters of subcodes of algebraic-geometric codes over prime subfields
inferred← citeshttps://doi.org/10.1016/j.disc.2019.111653openalex-snapshot
Galois correspondence on linear codes over finite chain rings
inferred← citeshttps://doi.org/10.1016/j.ffa.2010.01.002openalex-snapshot
Galois invariance, trace codes and subfield subcodes
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.04.007openalex-snapshot
New identities relating wild Goppa codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2017.06.001openalex-snapshot
The Galois variance of constacyclic codes
inferred← citeshttps://doi.org/10.1016/j.ffa.2022.102138openalex-snapshot
Stabilizer quantum codes defined by trace-depending polynomials
inferred← citeshttps://doi.org/10.1017/9780511982170openalex-snapshot
Codes, Cryptology and Curves with Computer Algebra
inferred← citeshttps://doi.org/10.1023/a:1011281431366openalex-snapshot
True Dimension of Some Binary Quadratic Trace Goppa Codes
inferred← citeshttps://doi.org/10.1088/1742-6596/855/1/012032openalex-snapshot
Error-correcting pairs for a public-key cryptosystem
inferred← citeshttps://doi.org/10.1090/conm/632/12622openalex-snapshot
Generalized rank weights: A duality statement
inferred← citeshttps://doi.org/10.1090/s0002-9939-2014-12011-9openalex-snapshot
Codes and the Cartier operator
inferred← citeshttps://doi.org/10.1109/18.135654openalex-snapshot
The trace operator and redundancy of Goppa codes
inferred← citeshttps://doi.org/10.1109/18.476320openalex-snapshot
A code decomposition approach for decoding cyclic and algebraic-geometric codes
inferred← citeshttps://doi.org/10.1109/18.651049openalex-snapshot
Spectra of long primitive binary BCH codes cannot approach the binomial distribution
inferred← citeshttps://doi.org/10.1109/allerton.2012.6483264openalex-snapshot
New parameters of linear codes expressing security performance of universal secure network coding
inferred← citeshttps://doi.org/10.1109/allerton.2016.7852315openalex-snapshot
Unifying notions of generalized weights for universal security on wire-tap networks
inferred← citeshttps://doi.org/10.1109/allerton.2018.8635867openalex-snapshot
Universal and Dynamic Locally Repairable Codes with Maximal Recoverability via Sum-Rank Codes
inferred← citeshttps://doi.org/10.1109/icccworkshops55477.2022.9896651openalex-snapshot
Parameters and Decoding Performance of Subfield Subcodes of One-Point Elliptic Codes
inferred← citeshttps://doi.org/10.1109/isit.2006.261957openalex-snapshot
Primitive Quantum BCH Codes over Finite Fields
inferred← citeshttps://doi.org/10.1109/isit.2010.5513688openalex-snapshot
Subfield-subcodes of Generalized Toric codes
inferred← citeshttps://doi.org/10.1109/isit.2016.7541641openalex-snapshot
Generalized Rank Weights of Reducible Codes, Optimal Cases, and Related Properties
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9518127openalex-snapshot
Dual-containing Alternant Codes for Applications in the Calderbank-Shor-Steane Construction
inferred← citeshttps://doi.org/10.1109/itw.2014.6970809openalex-snapshot
Rank weight hierarchy of some classes of cyclic codes
inferred← citeshttps://doi.org/10.1109/iwsda.2011.6159409openalex-snapshot
Linear recurring sequences and subfield subcodes
inferred← citeshttps://doi.org/10.1109/tit.2015.2429713openalex-snapshot
Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2016.2570238openalex-snapshot
On the Similarities Between Generalized Rank and Hamming Weights and Their Applications to Network Coding
inferred← citeshttps://doi.org/10.1109/tit.2017.2712636openalex-snapshot
Cryptanalysis of McEliece Cryptosystem Based on Algebraic Geometry Codes and Their Subcodes
inferred← citeshttps://doi.org/10.1109/tit.2017.2766292openalex-snapshot
Relative Generalized Matrix Weights of Matrix Codes for Universal Security on Wire-Tap Networks
inferred← citeshttps://doi.org/10.1109/tit.2018.2868442openalex-snapshot
Classical and Quantum Evaluation Codes at the Trace Roots
inferred← citeshttps://doi.org/10.1109/tit.2019.2924888openalex-snapshot
Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.2970405openalex-snapshot
Optimal Binary Linear Codes From Maximal Arcs
inferred← citeshttps://doi.org/10.1109/tit.2023.3317244openalex-snapshot
Fundamental Results on a Class of Affine Polar Grassmann Codes and Their Duals
inferred← citeshttps://doi.org/10.14232/phd.10475openalex-snapshot
On the dimension of the subfield subcodes of Hermitian codes
inferred← citeshttps://doi.org/10.1587/transfun.2020dmp0018openalex-snapshot
Private Information Retrieval from Coded Storage in the Presence of Omniscient and Limited-Knowledge Byzantine Adversaries
inferred← citeshttps://doi.org/10.3390/math4020032openalex-snapshot
On the Dimension of Algebraic-Geometric Trace Codes
inferred← citeshttps://doi.org/10.3934/amc.2017014openalex-snapshot
On defining generalized rank weights
inferred← citeshttps://doi.org/10.3934/amc.2017018openalex-snapshot
Rank equivalent and rank degenerate skew cyclic codes
inferred← citeshttps://doi.org/10.3934/amc.2017032openalex-snapshot
On parameters of subfield subcodes of extended norm-trace codes
inferred← citeshttps://doi.org/10.3934/amc.2022010openalex-snapshot
On the generalised rank weights of quasi-cyclic codes
inferred← citeshttps://doi.org/10.3934/amc.2024023openalex-snapshot
Retraction: A note on subfield subcodes and trace codes of cyclic codes
inferred← citeshttps://doi.org/10.3934/math.20261194openalex-snapshot
New lower bounds for the minimum distance of a class of binary Goppa codes
inferred← citeshttps://doi.org/10.48550/arxiv.0812.5104openalex-snapshot
On Quantum and Classical Error Control Codes: Constructions and Applications
inferred← citeshttps://doi.org/10.48550/arxiv.2110.08964openalex-snapshot
Affine Hermitian Grassmann 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.