On the public citation graph

Generating functions and lower bounds on rates for limited error-correcting codes

0 signed · 53 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.1016/s0019-9958(70)90369-4openalex-snapshot
Block codes for a class of constrained noiseless channels
inferredcites →https://doi.org/10.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1109/18.2600openalex-snapshot
On runlength codes
inferredcites →https://doi.org/10.1109/18.333860openalex-snapshot
Lower bounds on achievable rates for limited bitshift correcting codes
inferredcites →https://doi.org/10.1109/18.79965openalex-snapshot
Upper bounds on error-correcting runlength-limited block codes
inferredcites →https://doi.org/10.1109/tit.1982.1056516openalex-snapshot
Information rates and power spectra of digital codes
inferredcites →https://doi.org/10.1109/tmag.1981.1061721openalex-snapshot
Channel capacity of charge-constrained run-length limited codes
inferredcites →https://doi.org/10.1109/tmag.1984.1063328openalex-snapshot
Lower bounds on the minimum hamming distance achievable with runlengh constrained or DC free block codes and the synthesis of a (16,8) Dmin= 4 DC free block code
inferredcites →https://doi.org/10.1109/tmag.1987.1065193openalex-snapshot
Combined error correction/Modulation codes
inferredcites →https://doi.org/10.1147/rd.144.0376openalex-snapshot
Sequence-state Methods for Run-length-limited Coding
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.

What points at this work

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

inferred← citeshttps://doi.org/10.1002/ett.4460070309openalex-snapshot
Upper bounds on the size of error‐correcting runlength‐limited codes
inferred← citeshttps://doi.org/10.1017/cbo9780511843204openalex-snapshot
Analytic Pattern Matching
inferred← citeshttps://doi.org/10.1049/el:19951252openalex-snapshot
Computational cutoff rate of inputrunlength-limited BSC
inferred← citeshttps://doi.org/10.1109/18.144702openalex-snapshot
Improved Gilbert-Varshamov bound for constrained systems
inferred← citeshttps://doi.org/10.1109/18.212300openalex-snapshot
Perfect (d,k)-codes capable of correcting single peak-shifts
inferred← citeshttps://doi.org/10.1109/18.256522openalex-snapshot
A generalized Gilbert-Varshamov bound derived via analysis of a code-search algorithm
inferred← citeshttps://doi.org/10.1109/18.333860openalex-snapshot
Lower bounds on achievable rates for limited bitshift correcting codes
inferred← citeshttps://doi.org/10.1109/18.340459openalex-snapshot
Construction of fixed-length insertion/deletion correcting runlength-limited codes
inferred← citeshttps://doi.org/10.1109/18.391257openalex-snapshot
Upper bounds and Hamming spheres under the DC constraint
inferred← citeshttps://doi.org/10.1109/18.623158openalex-snapshot
The generalized Gilbert-Varshamov bound is implied by Turan's theorem [code construction]
inferred← citeshttps://doi.org/10.1109/18.79949openalex-snapshot
DC-constrained codes from Hadamard matrices
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/allerton.2013.6736585openalex-snapshot
Improved bounds and constructions for granular media coding
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/icc.1996.533670openalex-snapshot
Computational cutoff rate of an input runlength-limited BSC
inferred← citeshttps://doi.org/10.1109/isit.1993.748551openalex-snapshot
Asymptotic Bounds on the Rates of Runlength-Limited Codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748559openalex-snapshot
Correcting Single Peak-shifts with Perfect (d,k)-codes
inferred← citeshttps://doi.org/10.1109/isit.1994.394761openalex-snapshot
Upper bounds and Hamming spheres under the DC-constraint
inferred← citeshttps://doi.org/10.1109/isit.2006.262115openalex-snapshot
On (d, k) Sequences Not Containing a Given Word
inferred← citeshttps://doi.org/10.1109/isit.2007.4557611openalex-snapshot
Pattern Matching in Constrained Sequences
inferred← citeshttps://doi.org/10.1109/isit.2008.4595368openalex-snapshot
Large deviations for constrained pattern matching
inferred← citeshttps://doi.org/10.1109/isit.2011.6033981openalex-snapshot
Bounds and constructions for granular media coding
inferred← citeshttps://doi.org/10.1109/isit.2014.6875007openalex-snapshot
New upper bounds for grain-correcting and grain-detecting codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006597openalex-snapshot
On the VC-dimension of binary codes
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.10206533openalex-snapshot
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206570openalex-snapshot
A Version of Delsarte's Linear Program for Constrained Systems
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206902openalex-snapshot
Evaluation of the Gilbert–Varshamov Bound using Multivariate Analytic Combinatorics
inferred← citeshttps://doi.org/10.1109/jsait.2023.3279113openalex-snapshot
Estimating the Sizes of Binary Error-Correcting Constrained Codes
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.2011.2145490openalex-snapshot
Constant-Weight and Constant-Charge Binary Run-Length Limited 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.2445758openalex-snapshot
New Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.1109/tit.2023.3343187openalex-snapshot
Quantized-Constraint Concatenation and the Covering Radius of Constrained Systems
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.1137/18m116486xopenalex-snapshot
On the VC-Dimension of Binary Codes
inferred← citeshttps://doi.org/10.1145/1921659.1921671openalex-snapshot
Constrained pattern matching
inferred← citeshttps://doi.org/10.14209/jcis.1997.11openalex-snapshot
Generating Series and Capacity for Constrained Sequences
inferred← citeshttps://doi.org/10.14209/sbrt.2011.152openalex-snapshot
Applications of Enumerative Techniques in Communications
inferred← citeshttps://doi.org/10.1561/0100000132openalex-snapshot
Maximizing Entropy with an Expectation Constraint and One-Parameter Exponential Families of Distributions: A Reexamination
inferred← citeshttps://doi.org/10.3390/e26040346openalex-snapshot
Evaluating the Gilbert–Varshamov Bound for Constrained Systems
inferred← citeshttps://doi.org/10.46298/dmtcs.382openalex-snapshot
Waiting time distributions for pattern occurrence in a constrained sequence
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.