On the public citation graph

Bounds and constructions for runlength-limited error-control block codes

0 signed · 36 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(79)90329-2openalex-snapshot
On the theory of binary asymmetric error correcting codes
inferredcites →https://doi.org/10.1016/s0019-9958(82)91125-1openalex-snapshot
Optimal asymmetric error detecting codes
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting 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.45295openalex-snapshot
A general error-correcting code construction for run-length limited binary channels
inferredcites →https://doi.org/10.1109/18.79965openalex-snapshot
Upper bounds on error-correcting runlength-limited block codes
inferredcites →https://doi.org/10.1109/20.42534openalex-snapshot
Error detecting multiple block (d,k) codes
inferredcites →https://doi.org/10.1109/5.63306openalex-snapshot
Runlength-limited sequences
inferredcites →https://doi.org/10.1109/icc.1989.49948openalex-snapshot
Magnetic and optical storage systems: opportunities for communications technology
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage
inferredcites →https://doi.org/10.1147/rd.282.0206openalex-snapshot
Analysis of Correctable Errors in the IBM 3380 Disk File
inferredcites →https://doi.org/10.1201/9780203490310.ch17openalex-snapshot
Runlength Limited Sequences

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.1109/18.104318openalex-snapshot
Runlength-limited codes for mixed-error channels
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.333860openalex-snapshot
Lower bounds on achievable rates for limited bitshift correcting codes
inferred← citeshttps://doi.org/10.1109/18.335946openalex-snapshot
Bounds on the zero-error capacity of the input-constrained bit-shift channel
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.382032openalex-snapshot
Runlength-limited codes for single error detection in the magnetic recording channel
inferred← citeshttps://doi.org/10.1109/18.391254openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/18.567731openalex-snapshot
Cascading methods for runlength-limited arrays
inferred← citeshttps://doi.org/10.1109/18.623139openalex-snapshot
A practical method for approaching the channel capacity of constrained channels
inferred← citeshttps://doi.org/10.1109/18.79965openalex-snapshot
Upper bounds on error-correcting runlength-limited block codes
inferred← citeshttps://doi.org/10.1109/26.917767openalex-snapshot
DC-free error-correcting codes based on convolutional codes
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748440openalex-snapshot
A Scheme for Combined Modulation and Error Correction
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.2011.6033981openalex-snapshot
Bounds and constructions for granular media coding
inferred← citeshttps://doi.org/10.1109/isit.2019.8849247openalex-snapshot
Bounds on Codes for the Bit-Shift Channel with (d,k)-Constrained Inputs
inferred← citeshttps://doi.org/10.1109/tcomm.1994.580204openalex-snapshot
Some construction methods for error-correcting (d,k) codes
inferred← citeshttps://doi.org/10.1109/tgcn.2019.2919780openalex-snapshot
Are Run-Length Limited Codes Suitable for Simultaneous Energy and Information Transfer?
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.2019.2907979openalex-snapshot
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
inferred← citeshttps://doi.org/10.47749/t/unicamp.2001.206665openalex-snapshot
Codigos de linha a partir de codigos corretores de erro concatenados
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09040openalex-snapshot
Are RLL Codes Suitable for Simultaneous Energy and Information Transfer?
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.