On the public citation graph
Bounds on Minimum Distance for Linear Codes over GF(5)
0 signed · 21 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.1007/3-540-63163-1_17openalex-snapshot
Optimal linear codes of dimension 4 over GF(5)
inferredcites →https://doi.org/10.1007/bf00124211openalex-snapshot
Optimal ternary quasi-cyclic codes
inferredcites →https://doi.org/10.1007/bfb0025133openalex-snapshot
Some best rate 1/p quasi-cyclic codes over GF(5)
inferredcites →https://doi.org/10.1016/s0012-365x(99)00168-5openalex-snapshot
Near-MDS codes over some small fields
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.144719openalex-snapshot
Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
inferredcites →https://doi.org/10.1109/18.212302openalex-snapshot
The linear programming bound for binary linear codes
inferredcites →https://doi.org/10.1109/18.623167openalex-snapshot
New good quasi-cyclic ternary and quaternary linear 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/s11128-022-03794-1openalex-snapshot
Non-binary quantum synchronizable codes based on cyclic codes over $$\textrm{F}_q$$
inferred← citeshttps://doi.org/10.1016/s0012-365x(00)00383-6openalex-snapshot
Bounds on codes over an alphabet of five elements
inferred← citeshttps://doi.org/10.1016/s0012-365x(03)00126-2openalex-snapshot
New minimum distance bounds for linear codes over GF(5)
inferred← citeshttps://doi.org/10.1016/s0893-9659(02)00050-2openalex-snapshot
New quasi-cyclic codes over 5
inferred← citeshttps://doi.org/10.1023/a:1013873906597openalex-snapshot
New Minimum Distance Bounds for Linear Codes over Small Fields
inferred← citeshttps://doi.org/10.1063/5.0328009openalex-snapshot
Computational construction of new projective linear codes of dimension 5 over GF(7)
inferred← citeshttps://doi.org/10.1080/09720502.2021.1885818openalex-snapshot
Applications geometry of space inPG(3,P)
inferred← citeshttps://doi.org/10.1088/1742-6596/1879/2/022112openalex-snapshot
A Geometric Construction of Surface Complete (k, r)-cap in PG (3, 7)
inferred← citeshttps://doi.org/10.1109/acct51235.2020.9383337openalex-snapshot
New QC Codes over GF(11)
inferred← citeshttps://doi.org/10.1109/tit.2020.3015681openalex-snapshot
Non-Split Toric BCH Codes on Singular del Pezzo Surfaces
inferred← citeshttps://doi.org/10.1134/s0032946007020056openalex-snapshot
Some high-rate linear codes over GF(5) and GF(7)
inferred← citeshttps://doi.org/10.13069/jacodesmath.v10i1.234openalex-snapshot
New good quasi-cyclic codes and codes with improved minimum distance
inferred← citeshttps://doi.org/10.7508/ijmsi.2015.01.002openalex-snapshot
Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3
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.