On the public citation graph
A New Class of Cyclic Codes
0 signed · 35 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.1073/pnas.27.7.345openalex-snapshot
On the Riemann Hypothesis in Function-Fields
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1137/0108018openalex-snapshot
Polynomial Codes Over Certain Finite Fields
inferredcites →https://doi.org/10.1137/0109055openalex-snapshot
A New Treatment of Bose-Chaudhuri Codes
inferredcites →https://doi.org/10.1215/s0012-7094-57-02406-7openalex-snapshot
Bounds for exponential sums
inferredcites →https://doi.org/10.1215/s0012-7094-63-03019-9openalex-snapshot
Lower bounds for the maximum moduli of certain classes of trigonometric sums
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11779360_32openalex-snapshot
Improved Bounds on Weil Sums over Galois Rings and Homogeneous Weights
inferred← citeshttps://doi.org/10.1007/bf01084252openalex-snapshot
Algebraic theory of block codes detecting independent errors
inferred← citeshttps://doi.org/10.1007/bf01438279openalex-snapshot
Divisibility properties and new bounds for cyclic codes and exponential sums in one and several variables
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90036-2openalex-snapshot
A survey of constructive coding theory, and a table of binary codes of highest known rate
inferred← citeshttps://doi.org/10.1016/s0019-9958(69)90411-2openalex-snapshot
Tri-weight codes and generalized hadamard matrices
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90709-3openalex-snapshot
Bounds for binary codes just outside the plotkin range
inferred← citeshttps://doi.org/10.1109/18.259637openalex-snapshot
Minimum distance bounds for cyclic codes and Deligne's theorem
inferred← citeshttps://doi.org/10.1109/18.370147openalex-snapshot
An upper bound for Weil exponential sums over Galois rings and applications
inferred← citeshttps://doi.org/10.1109/18.59949openalex-snapshot
An upper bound on the covering radius as a function of the dual distance
inferred← citeshttps://doi.org/10.1109/18.746798openalex-snapshot
On the distance distribution of duals of BCH codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517770openalex-snapshot
New Packings in Grassmannian Space
inferred← citeshttps://doi.org/10.1109/proc.1980.11697openalex-snapshot
Crosscorrelation properties of pseudorandom and related sequences
inferred← citeshttps://doi.org/10.1109/taes.1973.309731openalex-snapshot
Output Signal-to-Noise Ratio for a Random-Access Repeater Link with an Ideal Hard Limiter
inferred← citeshttps://doi.org/10.1109/tcom.1969.1090080openalex-snapshot
Analysis of a Spread-Spectrum Multiple-Access System with a Hard Limiter
inferred← citeshttps://doi.org/10.1109/tit.1973.1055099openalex-snapshot
Shortened BCH codes (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.2004.834743openalex-snapshot
An Improvement on the Bounds of Weil Exponential Sums Over Galois Rings With Some Applications
inferred← citeshttps://doi.org/10.1109/tit.2021.3133071openalex-snapshot
Analog Subspace Coding: A New Approach to Coding for Non-Coherent Wireless Networks
inferred← citeshttps://doi.org/10.1155/2014/686138openalex-snapshot
The Weight Distributions of a Class of Cyclic Codes with Three Nonzeros over𝔽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.