On the public citation graph

Coding Theory and Applications

0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bfb0019844openalex-snapshot
Families of codes exceeding the Varshamov-Gilbert bound
inferredcites →https://doi.org/10.1007/bfb0019845openalex-snapshot
Polynomial factorization using Brill-Noether algorithm
inferredcites →https://doi.org/10.1007/bfb0019846openalex-snapshot
New bounds on cyclic codes from algebraic curves
inferredcites →https://doi.org/10.1007/bfb0019847openalex-snapshot
Exponential sums and the Carlitz-Uchiyama bound
inferredcites →https://doi.org/10.1007/bfb0019848openalex-snapshot
Bounds on the use of the postal channel
inferredcites →https://doi.org/10.1007/bfb0019849openalex-snapshot
A new authentication algorithm
inferredcites →https://doi.org/10.1007/bfb0019852openalex-snapshot
Weighted decoding of linear block codes by solving a system of implicit equations

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/net.3230230105openalex-snapshot
Efficient parallel algorithms for bipartite permutation graphs
inferred← citeshttps://doi.org/10.1006/jnth.1998.2277openalex-snapshot
Generalized Reed–Muller Codes and Curves with Many Points
inferred← citeshttps://doi.org/10.1007/11415787_10openalex-snapshot
The Challenge of Probabilistic Event B—Extended Abstract—
inferred← citeshttps://doi.org/10.1007/s001650070008openalex-snapshot
Encoding, Decoding and Data Refinement
inferred← citeshttps://doi.org/10.1007/s10623-005-2542-xopenalex-snapshot
Codes Over the p-adic Integers
inferred← citeshttps://doi.org/10.1016/0012-365x(90)90059-qopenalex-snapshot
Distribution of the weights of the dual of the melas code
inferred← citeshttps://doi.org/10.1016/j.ffa.2009.12.004openalex-snapshot
Fast arithmetic in unramified p-adic fields
inferred← citeshttps://doi.org/10.1016/j.ffa.2014.11.009openalex-snapshot
Codes over a weighted torus
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2011.09.030openalex-snapshot
The dual minimum distance of arbitrary-dimensional algebraic–geometric codes
inferred← citeshttps://doi.org/10.1016/j.jisa.2016.03.004openalex-snapshot
Design and implementation of hardware-efficient modified Rao–Nam scheme with high security for wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.jmaa.2021.125112openalex-snapshot
Specification property for step skew products
inferred← citeshttps://doi.org/10.1016/j.jsc.2012.06.004openalex-snapshot
On the bit-complexity of sparse polynomial and series multiplication
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.04.026openalex-snapshot
An improved algorithm for learning sparse parities in the presence of noise
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)80001-1openalex-snapshot
Univariate polynomial factorization over finite fields
inferred← citeshttps://doi.org/10.1093/comjnl/bxad070openalex-snapshot
Relinearization Attack On LPN Over Large Fields
inferred← citeshttps://doi.org/10.1145/3560828.3564010openalex-snapshot
Hardware Moving Target Defenses against Physical Attacks
inferred← citeshttps://doi.org/10.1186/s13638-021-01901-xopenalex-snapshot
Shortened LDPC codes accelerate OSD decoding performance
inferred← citeshttps://doi.org/10.3390/cryptography5010011openalex-snapshot
A New Class of Q-Ary Codes for the McEliece Cryptosystem
inferred← citeshttps://doi.org/10.3390/cryptography5040033openalex-snapshot
Generalized Concatenated Codes over Gaussian and Eisenstein Integers for Code-Based Cryptography
inferred← citeshttps://doi.org/10.3390/math12030443openalex-snapshot
Decoding of Z2S Linear Generalized Kerdock Codes
inferred← citeshttps://doi.org/10.3390/math13172841openalex-snapshot
Unfolding Post-Quantum Cryptosystems: CRYSTALS-Dilithium, McEliece, BIKE, and HQC
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.