On the public citation graph
Asymptotic Improvement of the Gilbert–Varshamov Bound on the Size of Binary Codes
0 signed · 114 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.1002/j.1538-7305.1952.tb01393.xopenalex-snapshot
A Comparison of Signalling Alphabets
inferredcites →https://doi.org/10.1002/j.1538-7305.1967.tb04246.xopenalex-snapshot
Random Packings and Coverings of the Unit n-Sphere
inferredcites →https://doi.org/10.1002/mana.19821090103openalex-snapshot
Modular curves, Shimura curves, and Goppa codes, better than Varshamov‐Gilbert bound
inferredcites →https://doi.org/10.1006/jctb.1999.1910openalex-snapshot
Coloring Graphs with Sparse Neighborhoods
inferredcites →https://doi.org/10.1007/978-1-4757-2016-7openalex-snapshot
Sphere Packings, Lattices and Groups
inferredcites →https://doi.org/10.1016/0020-0190(96)00072-5openalex-snapshot
Independent sets in graphs with triangles
inferredcites →https://doi.org/10.1016/0097-3165(80)90030-8openalex-snapshot
A note on Ramsey numbers
inferredcites →https://doi.org/10.1016/s0020-0190(02)00301-0openalex-snapshot
New bounds on a hypercube coloring problem
inferredcites →https://doi.org/10.1016/s0024-3795(99)00271-2openalex-snapshot
Strengthening the Gilbert–Varshamov bound
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1017/s030500410002168xopenalex-snapshot
On colouring the nodes of a network
inferredcites →https://doi.org/10.1023/a:1008206125050openalex-snapshot
Bounds on Spectra of Codes with Known Dual Distance
inferredcites →https://doi.org/10.1049/piee.1978.0028openalex-snapshot
Improvement on Varshamov-Gilbert lower bound on minimum Hamming distance of linear codes
inferredcites →https://doi.org/10.1080/09720529.2001.10697920openalex-snapshot
Sharpening the Gilbert-Varshamov bound in the finite case
inferredcites →https://doi.org/10.1109/18.144702openalex-snapshot
Improved Gilbert-Varshamov bound for constrained systems
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.370148openalex-snapshot
The threshold probability of a code
inferredcites →https://doi.org/10.1109/18.412690openalex-snapshot
On the accuracy of the binomial approximation to the distance distribution of codes
inferredcites →https://doi.org/10.1109/18.412711openalex-snapshot
On the distance distribution of codes
inferredcites →https://doi.org/10.1109/18.623158openalex-snapshot
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
inferredcites →https://doi.org/10.1109/18.641543openalex-snapshot
Averaging bounds for lattices and linear codes
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/18.841167openalex-snapshot
Distance-spectrum formulas on the largest minimum distance of block codes
inferredcites →https://doi.org/10.1109/18.915662openalex-snapshot
Estimates of the distance distribution of codes and designs
inferredcites →https://doi.org/10.1109/lcn.1996.558180openalex-snapshot
A new multihop lightwave network based on the generalized De-Bruijn graph
inferredcites →https://doi.org/10.1109/tit.1974.1055222openalex-snapshot
Some long cyclic linear binary codes are not so bad
inferredcites →https://doi.org/10.1109/tit.1983.1056743openalex-snapshot
Some results on the existence of binary linear codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.2003.813559openalex-snapshot
Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound
inferredcites →https://doi.org/10.1515/crll.1905.129.220openalex-snapshot
Diskontinuitätsbereich für arithmetische Äquivalenz.
inferredcites →https://doi.org/10.2307/2323992openalex-snapshot
Sphere Packings, Lattices and Groups.
inferredcites →https://doi.org/10.46298/dmtcs.3456openalex-snapshot
Improving the Gilbert-Varshamov bound for $q$-ary codes
inferredcites →https://doi.org/10.48550/arxiv.math/0308046openalex-snapshot
Still better nonlinear codes from modular curves
inferredcites →https://doi.org/10.48550/arxiv.math/0402132openalex-snapshot
A Lower Bound on the Density of Sphere Packings via Graph Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jgt.22220openalex-snapshot
Families of locally separated Hamilton paths
inferred← citeshttps://doi.org/10.1007/978-0-8176-8256-9_1openalex-snapshot
Background on Information Theory and Coding Theory
inferred← citeshttps://doi.org/10.1007/978-0-8176-8256-9_5openalex-snapshot
Hyperelliptic Curves and Quadratic Residue Codes
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-031-70285-3_42openalex-snapshot
On Resilience of Distributed Flooding Algorithm to Stochastic Link Failures
inferred← citeshttps://doi.org/10.1007/978-3-642-10781-8_17openalex-snapshot
On the Complexity of the Greedy Construction of Linear Error-Correcting Codes
inferred← citeshttps://doi.org/10.1007/s00373-010-0959-0openalex-snapshot
Ramsey Numbers of Some Bipartite Graphs Versus Complete Graphs
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-016-0255-yopenalex-snapshot
Proof of a conjecture of Kløve on permutation codes under the Chebychev distance
inferred← citeshttps://doi.org/10.1007/s10623-019-00641-wopenalex-snapshot
New theoretical bounds and constructions of permutation codes under block permutation metric
inferred← citeshttps://doi.org/10.1007/s10623-024-01377-yopenalex-snapshot
Balanced reconstruction codes for single edits
inferred← citeshttps://doi.org/10.1016/j.aim.2018.07.001openalex-snapshot
On kissing numbers and spherical codes in high dimensions
inferred← citeshttps://doi.org/10.1016/j.comcom.2023.12.001openalex-snapshot
Fragmentation of data packets in wireless sensor network with variable temperature and channel conditions
inferred← citeshttps://doi.org/10.1016/j.dam.2021.08.030openalex-snapshot
The clique distribution in powers of hypercubes
inferred← citeshttps://doi.org/10.1016/j.jcta.2023.105835openalex-snapshot
Singleton-type bounds for list-decoding and list-recovery, and related results
inferred← citeshttps://doi.org/10.1017/fms.2018.25openalex-snapshot
ON THE HARD SPHERE MODEL AND SPHERE PACKINGS IN HIGH DIMENSIONS
inferred← citeshttps://doi.org/10.1017/s0963548323000123openalex-snapshot
Subspace coverings with multiplicities
inferred← citeshttps://doi.org/10.1088/1742-5468/adba42openalex-snapshot
Loop corrections for hard spheres in Hamming space
inferred← citeshttps://doi.org/10.1103/physreve.85.021106openalex-snapshot
Cavity approach to sphere packing in Hamming space
inferred← citeshttps://doi.org/10.1109/ciss.2018.8362289openalex-snapshot
Applications of an exact formula for the largest minimum distance of block codes
inferred← citeshttps://doi.org/10.1109/isit.2006.261851openalex-snapshot
Asymptotic improvement of the Gilbert-Varshamov bound for binary linear codes
inferred← citeshttps://doi.org/10.1109/isit.2016.7541568openalex-snapshot
Sequence reconstruction over the deletion channel
inferred← citeshttps://doi.org/10.1109/isit.2017.8006781openalex-snapshot
Reconstruction of sequences over non-identical channels
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9173937openalex-snapshot
Distribution of the Minimum Distance of Random Linear Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517946openalex-snapshot
On the Hamming Weight Distribution of Subsequences of Pseudorandom Sequences
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834432openalex-snapshot
New Bounds on the Size of Binary Codes with Large Minimum Distance
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619163openalex-snapshot
An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11653901openalex-snapshot
Reconstructing Reed–Solomon Codes from Multiple Noisy Channel Outputs
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195672openalex-snapshot
Zero-Error Superposition Codes
inferred← citeshttps://doi.org/10.1109/ita.2008.4601075openalex-snapshot
Minimum distance bounds for expander codes
inferred← citeshttps://doi.org/10.1109/itw.2005.1531849openalex-snapshot
Duality between packings and coverings of the Hamming space
inferred← citeshttps://doi.org/10.1109/itw.2014.6970810openalex-snapshot
Gilbert-Varshamov-like lower bounds for deletion-correcting codes
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611515openalex-snapshot
The Intersection of Insertion and Deletion Balls
inferred← citeshttps://doi.org/10.1109/itw61385.2024.10806912openalex-snapshot
Achievability Bounds on Unequal Error Protection Codes
inferred← citeshttps://doi.org/10.1109/jsait.2023.3295836openalex-snapshot
New Bounds on the Size of Binary Codes With Large Minimum Distance
inferred← citeshttps://doi.org/10.1109/jsait.2023.3338326openalex-snapshot
Dimensions of Channel Coding: From Theory to Algorithms to Applications
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.2005.853300openalex-snapshot
Improving the Gilbert–Varshamov Bound for $q$ -Ary Codes
inferred← citeshttps://doi.org/10.1109/tit.2008.928288openalex-snapshot
Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2010.2054330openalex-snapshot
Group Codes Outperform Binary-Coset Codes on Nonbinary Symmetric Memoryless Channels
inferred← citeshttps://doi.org/10.1109/tit.2012.2207370openalex-snapshot
The Asymptotic Behavior of Grassmannian Codes
inferred← citeshttps://doi.org/10.1109/tit.2013.2237945openalex-snapshot
An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
inferred← citeshttps://doi.org/10.1109/tit.2016.2642987openalex-snapshot
New Lower Bounds for Secure Codes and Related Hash Families: A Hypergraph Theoretical Approach
inferred← citeshttps://doi.org/10.1109/tit.2017.2649493openalex-snapshot
Exact Reconstruction From Insertions in Synchronization Codes
inferred← citeshttps://doi.org/10.1109/tit.2018.2800044openalex-snapshot
Sequence Reconstruction Over the Deletion Channel
inferred← citeshttps://doi.org/10.1109/tit.2018.2859813openalex-snapshot
Reconstruction of Sequences Over Non-Identical Channels
inferred← citeshttps://doi.org/10.1109/tit.2018.2878750openalex-snapshot
On the Uncertainty of Information Retrieval in Associative Memories
inferred← citeshttps://doi.org/10.1109/tit.2018.2889244openalex-snapshot
On the Maximum Size of Block Codes Subject to a Distance Criterion
inferred← citeshttps://doi.org/10.1109/tit.2021.3110710openalex-snapshot
On Levenshtein’s Reconstruction Problem Under Insertions, Deletions, and Substitutions
inferred← citeshttps://doi.org/10.1109/tit.2022.3170341openalex-snapshot
Distribution of the Minimum Distance of Random Linear Codes
inferred← citeshttps://doi.org/10.1109/tit.2022.3232241openalex-snapshot
Exponential Decay of Intersection Volume With Applications on List-Decodability and Gilbert-Varshamov Type Bound
inferred← citeshttps://doi.org/10.1109/tit.2023.3296963openalex-snapshot
Improved Gilbert-Varshamov Bounds for Hopping Cyclic Codes and Optical Orthogonal Codes
inferred← citeshttps://doi.org/10.1109/tit.2023.3304565openalex-snapshot
Logarithmically Larger Deletion Codes of All Distances
inferred← citeshttps://doi.org/10.1109/tit.2024.3510698openalex-snapshot
A Deterministic Construction of a Large Distance Code From the Wozencraft Ensemble
inferred← citeshttps://doi.org/10.1109/tit.2025.3585691openalex-snapshot
Permutation and Multi-Permutation Codes Correcting Multiple Deletions
inferred← citeshttps://doi.org/10.1109/tmbmc.2024.3403488openalex-snapshot
Survey for a Decade of Coding for DNA Storage
inferred← citeshttps://doi.org/10.1142/s179383092150110xopenalex-snapshot
Construction of several classes of maximum codes
inferred← citeshttps://doi.org/10.1142/s1793830923500702openalex-snapshot
Linear hash functions and their applications to error detection and correction
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.1360/ssm-2019-0321openalex-snapshot
A method of constructing linear mapping families to achieve the asymptotic GV bound
inferred← citeshttps://doi.org/10.1561/0100000112openalex-snapshot
Codes for Adversaries: Between Worst-Case and Average-Case Jamming
inferred← citeshttps://doi.org/10.3934/amc.2007.1.173openalex-snapshot
New upper bounds on codes via association schemes and linear programming
inferred← citeshttps://doi.org/10.4208/csiam-am.so-2021-0024openalex-snapshot
Improving the Gilbert-Varshamov Bound by Graph Spectral Method
inferred← citeshttps://doi.org/10.46298/dmtcs.3456openalex-snapshot
Improving the Gilbert-Varshamov bound for $q$-ary codes
inferred← citeshttps://doi.org/10.46298/dmtcs.429openalex-snapshot
On quadratic residue codes and hyperelliptic curves
inferred← citeshttps://doi.org/10.48550/arxiv.1212.5679openalex-snapshot
Cumulative Distance Enumerators of Random Codes and their Thresholds
inferred← citeshttps://doi.org/10.48550/arxiv.1912.12833openalex-snapshot
Distribution of the minimal distance of random linear codes
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0507015openalex-snapshot
Duality between Packings and Coverings of the Hamming Space
inferred← citeshttps://doi.org/10.48550/arxiv.math/0406264openalex-snapshot
Equilateral sets in finite-dimensional normed spaces
inferred← citeshttps://doi.org/10.48550/arxiv.math/0609562openalex-snapshot
On quadratic residue codes and hyperelliptic curves
inferred← citeshttps://doi.org/10.7554/elife.08127openalex-snapshot
The number of olfactory stimuli that humans can discriminate is still unknown
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.