On the public citation graph

Error detecting multiple block (d,k) codes

0 signed · 20 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/0012-365x(78)90011-0openalex-snapshot
A characterization of the minimum cycle mean in a digraph
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.1109/icc.1989.49951openalex-snapshot
Coding using multiple block (d,k) codes
inferredcites →https://doi.org/10.1109/tit.1983.1056728openalex-snapshot
A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
inferredcites →https://doi.org/10.1109/tmag.1982.1062095openalex-snapshot
Applications of a peak detection channel model
inferredcites →https://doi.org/10.1147/rd.282.0206openalex-snapshot
Analysis of Correctable Errors in the IBM 3380 Disk File

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.133257openalex-snapshot
Error and erasure control (d,k) block codes
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.335946openalex-snapshot
Bounds on the zero-error capacity of the input-constrained bit-shift channel
inferred← citeshttps://doi.org/10.1109/18.391254openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/18.79948openalex-snapshot
Bounds and constructions for runlength-limited error-control block codes
inferred← citeshttps://doi.org/10.1109/18.79953openalex-snapshot
Bounds on the capacity of the bit-shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/20.104707openalex-snapshot
On the performance and implementation of a class of error and erasure control (d,k) block codes
inferred← citeshttps://doi.org/10.1109/20.104711openalex-snapshot
Coding for maximum likelihood detection on a magnetic recording channel
inferred← citeshttps://doi.org/10.1109/20.490277openalex-snapshot
Error correcting run-length limited codes for magnetic recording
inferred← citeshttps://doi.org/10.1109/glocom.1990.116788openalex-snapshot
Bounds on the capacity of the peak shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation 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/tcomm.1994.580204openalex-snapshot
Some construction methods for error-correcting (d,k) codes
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.