On the public citation graph

Saddle point techniques in asymptotic coding theory

0 signed · 23 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/978-3-642-58575-3openalex-snapshot
Introduction to Coding Theory
inferredcites →https://doi.org/10.1007/978-3-662-07998-0openalex-snapshot
Introduction to coding theory
inferredcites →https://doi.org/10.1016/0166-218x(84)90074-xopenalex-snapshot
On the asymptotic behaviour of Lee-codes
inferredcites →https://doi.org/10.1109/18.59949openalex-snapshot
An upper bound on the covering radius as a function of the dual distance
inferredcites →https://doi.org/10.1109/18.61138openalex-snapshot
Generalization of the Norse bounds to codes of higher strength
inferredcites →https://doi.org/10.1142/9407openalex-snapshot
Algebraic Coding Theory
inferredcites →https://doi.org/10.1214/aoms/1177706790openalex-snapshot
Saddle-point Methods for the Multinomial Distribution
inferredcites →https://doi.org/10.1214/aoms/1177728652openalex-snapshot
Saddlepoint Approximations in Statistics
inferredcites →https://doi.org/10.1515/crll.1956.196.67openalex-snapshot
A Generalisation of Stirling's Formula.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-81293-5_3openalex-snapshot
Classical and Quantum Algorithms for Generic Syndrome Decoding Problems and Applications to the Lee Metric
inferred← citeshttps://doi.org/10.1007/978-3-031-29689-5_7openalex-snapshot
Information Set Decoding for Lee-Metric Codes Using Restricted Balls
inferred← citeshttps://doi.org/10.1007/978-3-031-46495-9_4openalex-snapshot
FuLeeca: A Lee-Based Signature Scheme
inferred← citeshttps://doi.org/10.1007/s10623-013-9870-zopenalex-snapshot
Lower bounds on the minimum distance of long codes in the Lee metric
inferred← citeshttps://doi.org/10.1007/s10623-025-01604-0openalex-snapshot
Bounds on sphere sizes in the sum-rank metric and coordinate-additive metrics
inferred← citeshttps://doi.org/10.1007/s10623-025-01744-3openalex-snapshot
Information set decoding for ring-linear codes
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00133-4openalex-snapshot
Some results on the asymptotic behaviour of coefficients of large powers of functions
inferred← citeshttps://doi.org/10.1016/j.ipl.2025.106582openalex-snapshot
An information theoretic proof of the Chernoff-Hoeffding inequality
inferred← citeshttps://doi.org/10.1016/j.laa.2022.06.013openalex-snapshot
Density of free modules over finite chain rings
inferred← citeshttps://doi.org/10.1109/isit.2013.6620313openalex-snapshot
Lattice based codes for insertion and deletion channels
inferred← citeshttps://doi.org/10.1109/tit.2024.3483303openalex-snapshot
Gilbert–Varshamov Bound for Codes in L₁ Metric Using Multivariate Analytic Combinatorics
inferred← citeshttps://doi.org/10.1142/s021949882550063xopenalex-snapshot
The subfield metric and its application to quantum error correction
inferred← citeshttps://doi.org/10.3934/amc.2022029openalex-snapshot
On the hardness of the Lee syndrome decoding problem
inferred← citeshttps://doi.org/10.3934/math.20231198openalex-snapshot
Double circulant codes for the Lee and Euclidean distance
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.