On the public citation graph

DC-constrained error-correcting codes with small running digital sum

0 signed · 28 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.1002/j.1538-7305.1970.tb02525.xopenalex-snapshot
Upper Bound on the Efficiency of dc-Constrained Codes
inferredcites →https://doi.org/10.1016/0016-0032(60)90904-2openalex-snapshot
Introduction to matrix analysis
inferredcites →https://doi.org/10.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1023/b:prit.0000024877.03232.39openalex-snapshot
Binary Perfect Codes of Length 15 by the Generalized Concatenated Construction
inferredcites →https://doi.org/10.1088/0031-9112/37/1/030openalex-snapshot
Principles of Optical Disc Systems
inferredcites →https://doi.org/10.1109/18.30980openalex-snapshot
A multilevel approach to the design of DC-free line codes
inferredcites →https://doi.org/10.1109/18.42211openalex-snapshot
Coset codes for partial response channels; or, coset codes with spectral nulls
inferredcites →https://doi.org/10.1109/18.42227openalex-snapshot
On error-correcting balanced codes
inferredcites →https://doi.org/10.1109/18.6023openalex-snapshot
Baseband trellis codes with a spectral null at zero
inferredcites →https://doi.org/10.1109/18.9775openalex-snapshot
DC-free coset codes
inferredcites →https://doi.org/10.1109/tit.1986.1057214openalex-snapshot
A note on lower bounds (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057296openalex-snapshot
Binary transmission codes with higher order spectral zeros at zero frequency (Corresp.)
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.1985.1063964openalex-snapshot
The synthesis of magnetic recording trellis codes with good hamming distance properties
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage

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.1007/978-1-4615-2694-0_17openalex-snapshot
Charge Constrained Convolutional Codes
inferred← citeshttps://doi.org/10.1038/srep14138openalex-snapshot
A Rewritable, Random-Access DNA-Based Storage System
inferred← citeshttps://doi.org/10.1049/el:19931271openalex-snapshot
DC-free error-correcting convolutional codes
inferred← citeshttps://doi.org/10.1109/18.144702openalex-snapshot
Improved Gilbert-Varshamov bound for constrained systems
inferred← citeshttps://doi.org/10.1109/18.179362openalex-snapshot
Error-correcting codes with bounded running digital sum
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.391257openalex-snapshot
Upper bounds and Hamming spheres under the DC constraint
inferred← citeshttps://doi.org/10.1109/18.79949openalex-snapshot
DC-constrained codes from Hadamard matrices
inferred← citeshttps://doi.org/10.1109/20.490275openalex-snapshot
A new design of EFM constrained codes
inferred← citeshttps://doi.org/10.1109/allerton.2018.8635905openalex-snapshot
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems
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/tmbmc.2016.2537305openalex-snapshot
DNA-Based Storage: Trends and Methods
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.