On the public citation graph

Combining ECC with modulation: performance comparisons

0 signed · 38 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.1016/s0924-6509(08)x7030-8openalex-snapshot
The Theory of Error-Correcting Codes
inferredcites →https://doi.org/10.1109/18.42227openalex-snapshot
On error-correcting balanced 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/tit.1983.1056728openalex-snapshot
A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
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

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.1049/el:19920616openalex-snapshot
Runlength limited codes for random and burst error correction
inferred← citeshttps://doi.org/10.1049/el:19950377openalex-snapshot
Upper bound on number of productsin AND-OR-XOR expansion of logic functions
inferred← citeshttps://doi.org/10.1049/el:19950378openalex-snapshot
(4, 20) runlength limited modulation code for highdensity storage system
inferred← citeshttps://doi.org/10.1049/el:20000253openalex-snapshot
Constrained sequences with embedded redundancyfor error control
inferred← citeshttps://doi.org/10.1109/18.104318openalex-snapshot
Runlength-limited codes for mixed-error channels
inferred← citeshttps://doi.org/10.1109/18.144720openalex-snapshot
The (d,k) subcode of a linear block code
inferred← citeshttps://doi.org/10.1109/18.243467openalex-snapshot
A coding scheme for single peak-shift correction in (d, k)-constrained channels
inferred← citeshttps://doi.org/10.1109/18.335889openalex-snapshot
A new approach to constructing optimal block codes for runlength-limited channels
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.391254openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/18.476319openalex-snapshot
Analysis of coding schemes for modulation and error control
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.681333openalex-snapshot
A modified concatenated coding scheme, with applications to magnetic data storage
inferred← citeshttps://doi.org/10.1109/20.486540openalex-snapshot
Combined modulation and error correction codes for storage channels
inferred← citeshttps://doi.org/10.1109/20.490276openalex-snapshot
A construction technique for charge constrained (1, k≥4) 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/49.124469openalex-snapshot
Channels and codes for magnetooptical recording
inferred← citeshttps://doi.org/10.1109/79.689611openalex-snapshot
Shedding light on the future of SP for optical recording
inferred← citeshttps://doi.org/10.1109/ccece.2000.849671openalex-snapshot
A method of integrating error control and constrained sequence codes
inferred← citeshttps://doi.org/10.1109/comsig.1991.278239openalex-snapshot
Some new error-correcting (d,k) trellis codes for clock extraction on bandwidth limited channels
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/isit.1993.748317openalex-snapshot
Block-Decodable Runlength-Limited Codes via Look-Ahead Technique
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.1994.394827openalex-snapshot
The performance of different concatenated coding schemes for the noisy (1,7) constrained channel
inferred← citeshttps://doi.org/10.1109/isit.1994.394831openalex-snapshot
Runlength-limited block codes with small error propagation
inferred← citeshttps://doi.org/10.1109/isit.1995.531876openalex-snapshot
(4, 20) runlength limited modulation code for high density storage system
inferred← citeshttps://doi.org/10.1109/sicon.1995.526071openalex-snapshot
Multistage coding for data storage systems
inferred← citeshttps://doi.org/10.1109/tcomm.1994.580204openalex-snapshot
Some construction methods for error-correcting (d,k) codes
inferred← citeshttps://doi.org/10.1155/s1110865701000233openalex-snapshot
A Class of High-Rate"Equation missing" <!-- No EquationSource Format="TEX", only image --> Low-Complexity Error-Detecting RLL Codes
inferred← citeshttps://doi.org/10.47749/t/unicamp.2001.206665openalex-snapshot
Codigos de linha a partir de codigos corretores de erro concatenados
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.