On the public citation graph

The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]

0 signed · 57 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.1017/cbo9780511987045openalex-snapshot
A Course in Combinatorics
inferredcites →https://doi.org/10.1109/18.256522openalex-snapshot
A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm
inferredcites →https://doi.org/10.1109/18.79947openalex-snapshot
Generating functions and lower bounds on rates for limited error-correcting codes
inferredcites →https://doi.org/10.1109/tit.1983.1056614openalex-snapshot
Graph theoretic approaches to the code construction for the two-user multiple- access binary adder channel
inferredcites →https://doi.org/10.1201/b16132-57openalex-snapshot
Extremal Graph Theory
inferredcites →https://doi.org/10.1287/opre.42.5.860openalex-snapshot
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set

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-1-4419-6624-7_5openalex-snapshot
Graph Theoretic Methods in Coding Theory
inferred← citeshttps://doi.org/10.1007/978-3-030-33110-8_6openalex-snapshot
Improvement of the Binary Varshamov Bound
inferred← citeshttps://doi.org/10.1007/978-3-642-10868-6_1openalex-snapshot
Subspace Codes
inferred← citeshttps://doi.org/10.1007/s00373-026-03063-3openalex-snapshot
On the Transitivity of Gilbert Graphs and their Complements
inferred← citeshttps://doi.org/10.1007/s10623-023-01342-1openalex-snapshot
Improved bounds for codes correcting insertions and deletions
inferred← citeshttps://doi.org/10.1007/s11856-025-2820-4openalex-snapshot
Extremal number of graphs from geometric shapes
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.030openalex-snapshot
The clique distribution in powers of hypercubes
inferred← citeshttps://doi.org/10.1103/kx3b-4nrpopenalex-snapshot
Quantum Error Correction beyond S U ( 2 ) : Spin, Bosonic, and Permutation-Invariant Codes from Convex Geometry
inferred← citeshttps://doi.org/10.1109/18.841167openalex-snapshot
Distance-spectrum formulas on the largest minimum distance of block codes
inferred← citeshttps://doi.org/10.1109/cwit.2009.5069509openalex-snapshot
Projective space codes for the injection metric
inferred← citeshttps://doi.org/10.1109/isit.2002.1023642openalex-snapshot
Bounds for deletion/insertion correcting codes
inferred← citeshttps://doi.org/10.1109/isit.2008.4595111openalex-snapshot
Error-Correcting Codes in Projective Space
inferred← citeshttps://doi.org/10.1109/isit.2013.6620321openalex-snapshot
Error-correcting codes for multipermutations
inferred← citeshttps://doi.org/10.1109/isit.2014.6875034openalex-snapshot
Generalized sphere packing bound: Basic principles
inferred← citeshttps://doi.org/10.1109/isit.2016.7541806openalex-snapshot
Quickest sequence phase detection
inferred← citeshttps://doi.org/10.1109/isit.2018.8437544openalex-snapshot
Coding Over Sets for DNA Storage
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174514openalex-snapshot
Codes over Trees
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834754openalex-snapshot
Evaluating the Gilbert-Varshamov Bound for Constrained Systems
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206609openalex-snapshot
DNA Synthesis Using Shortmers
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206742openalex-snapshot
Bounds on Size of Homopolymer Free Codes
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619160openalex-snapshot
Noise-Tolerant Codebooks for Semi-Quantitative Group Testing: Application to Spatial Genomics
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619335openalex-snapshot
Improved Non-Asymptotic Lower Bound on the Size of Optimal Insertion/Deletion Correcting Code
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653743openalex-snapshot
On Sphere-Averaged ISI for Single Error-Correcting Codes in Molecular Communication
inferred← citeshttps://doi.org/10.1109/itw.2012.6404637openalex-snapshot
Results on combinatorial joint source-channel coding
inferred← citeshttps://doi.org/10.1109/tcomm.2022.3142159openalex-snapshot
Non-Coherent Multi-Level Index Modulation
inferred← citeshttps://doi.org/10.1109/tcomm.2026.3734309openalex-snapshot
On Asymptotic Optimal Constrained Codes for Joint ISI-Mitigation and Error Correction in Diffusion-Based Molecular Communication
inferred← citeshttps://doi.org/10.1109/tit.1998.651077openalex-snapshot
Correction to "The Generalized Gilbert-Varshamov Bound Is Implied By Turan's Theorem"
inferred← citeshttps://doi.org/10.1109/tit.2004.831751openalex-snapshot
Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2069211openalex-snapshot
Error Correcting Coding for a Nonsymmetric Ternary Channel
inferred← citeshttps://doi.org/10.1109/tit.2010.2095232openalex-snapshot
Error-Correcting Codes in Projective Space
inferred← citeshttps://doi.org/10.1109/tit.2012.2207370openalex-snapshot
The Asymptotic Behavior of Grassmannian Codes
inferred← citeshttps://doi.org/10.1109/tit.2014.2301811openalex-snapshot
Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.1109/tit.2015.2413418openalex-snapshot
Generalized Sphere Packing Bound
inferred← citeshttps://doi.org/10.1109/tit.2015.2445758openalex-snapshot
New Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.1109/tit.2017.2700847openalex-snapshot
Asymmetric Lee Distance Codes for DNA-Based Storage
inferred← citeshttps://doi.org/10.1109/tit.2017.2705159openalex-snapshot
Quickest Sequence Phase Detection
inferred← citeshttps://doi.org/10.1109/tit.2018.2864137openalex-snapshot
Bounds on the Size and Asymptotic Rate of Subblock-Constrained Codes
inferred← citeshttps://doi.org/10.1109/tit.2020.3006228openalex-snapshot
Single-Error Detection and Correction for Duplication and Substitution Channels
inferred← citeshttps://doi.org/10.1109/tit.2021.3057939openalex-snapshot
Codes Over Trees
inferred← citeshttps://doi.org/10.1109/tit.2023.3279768openalex-snapshot
Function-Correcting Codes
inferred← citeshttps://doi.org/10.1109/tit.2024.3515896openalex-snapshot
On DNA Synthesis Using Shortmers and the Capacity of Non-Deterministic Costly Constrained Graphs
inferred← citeshttps://doi.org/10.1109/tmbmc.2024.3388971openalex-snapshot
Bounds on the Maximum Cardinality of Indel and Substitution Correcting Codes
inferred← citeshttps://doi.org/10.1109/tmbmc.2024.3403488openalex-snapshot
Survey for a Decade of Coding for DNA Storage
inferred← citeshttps://doi.org/10.1112/jlms.70711openalex-snapshot
The codegree Turán density of tight cycles
inferred← citeshttps://doi.org/10.1134/s003294600904005xopenalex-snapshot
Algebraic codes for network coding
inferred← citeshttps://doi.org/10.1137/140988358openalex-snapshot
Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
inferred← citeshttps://doi.org/10.1142/s0129054119500199openalex-snapshot
Bounds on Subspace Codes Based on Orthogonal Space Over Finite Fields of Characteristic 2
inferred← citeshttps://doi.org/10.12677/aam.2021.101020openalex-snapshot
A Note on the Maximum Independent Set of the Power of Hypercubes
inferred← citeshttps://doi.org/10.1561/0100000112openalex-snapshot
Codes for Adversaries: Between Worst-Case and Average-Case Jamming
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.3390/e26040346openalex-snapshot
Evaluating the Gilbert–Varshamov Bound for Constrained Systems
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.