On the public citation graph
A new rate 2/3 sliding block code for the
0 signed · 52 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1109/18.79945openalex-snapshot
Bounds on the number of states in encoder graphs for input-constrained channels
inferredcites →https://doi.org/10.1109/26.35370openalex-snapshot
The power spectrum of run-length-limited codes
inferredcites →https://doi.org/10.1109/tit.1983.1056597openalex-snapshot
Algorithms for sliding block codes - An application of symbolic dynamics to information theory
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage
inferredcites →https://doi.org/10.1147/rd.331.0060openalex-snapshot
Statistical properties of selected recording codes
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4757-2471-4_4openalex-snapshot
Baseband Modulation Codes
inferred← citeshttps://doi.org/10.1007/978-94-010-0624-8_46openalex-snapshot
Modulation and Coding For Digital Magnetic Recording Systems
inferred← citeshttps://doi.org/10.1016/j.jmmm.2023.171370openalex-snapshot
Pattern constraints limiting nonlinear transition shift in high density magnetic recording
inferred← citeshttps://doi.org/10.1017/9781108899727openalex-snapshot
An Introduction to Symbolic Dynamics and Coding
inferred← citeshttps://doi.org/10.1017/9781108899727.001openalex-snapshot
Preface to the First Edition
inferred← citeshttps://doi.org/10.1017/9781108899727.002openalex-snapshot
Preface to the Second Edition
inferred← citeshttps://doi.org/10.1017/9781108899727.008openalex-snapshot
Shifts as Dynamical Systems
inferred← citeshttps://doi.org/10.1017/9781108899727.010openalex-snapshot
Finite-to-One Codes and Finite Equivalence
inferred← citeshttps://doi.org/10.1017/9781108899727.011openalex-snapshot
Degrees of Codes and Almost Conjugacy
inferred← citeshttps://doi.org/10.1017/9781108899727.012openalex-snapshot
Embeddings and Factor Codes
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.007openalex-snapshot
SHIFTS AS DYNAMICAL SYSTEMS
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.009openalex-snapshot
FINITE-TO-ONE CODES AND FINITE EQUIVALENCE
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.010openalex-snapshot
DEGREES OF CODES AND ALMOST CONJUGACY
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.011openalex-snapshot
EMBEDDINGS AND FACTOR CODES
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.014openalex-snapshot
GUIDE TO ADVANCED TOPICS
inferred← citeshttps://doi.org/10.1109/18.391253openalex-snapshot
A new construction for n-track (d, k) codes with redundancy
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.79945openalex-snapshot
Bounds on the number of states in encoder graphs for input-constrained channels
inferred← citeshttps://doi.org/10.1109/18.930919openalex-snapshot
Lower bounds on the anticipation of encoders for input-constrained channels
inferred← citeshttps://doi.org/10.1109/20.179818openalex-snapshot
A new class of two-dimensional RLL recording codes
inferred← citeshttps://doi.org/10.1109/26.545886openalex-snapshot
A reduced-complexity sequence detector with soft outputs for partial-response channels
inferred← citeshttps://doi.org/10.1109/35.120353openalex-snapshot
Modulation and coding for information storage
inferred← citeshttps://doi.org/10.1109/49.124467openalex-snapshot
Finite-state modulation codes for data storage
inferred← citeshttps://doi.org/10.1109/globecom54140.2023.10437031openalex-snapshot
Codecs for DNA-based Data Storage Systems with Multiple Constraints for Internet of Things
inferred← citeshttps://doi.org/10.1109/glocom.1993.318405openalex-snapshot
A reduced-complexity sequence detector with soft outputs for partial-response channels
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/icc.2003.1204569openalex-snapshot
Joint turbo channel detection and RLL decoding for (1, 7) coded partial response recording channels
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/itw46852.2021.9457670openalex-snapshot
RNN-based Detection for Coded Partial-Response Channels
inferred← citeshttps://doi.org/10.1109/jsac.2020.3041377openalex-snapshot
PR-NN: RNN-Based Detection for Coded Partial-Response Channels
inferred← citeshttps://doi.org/10.1109/ods.2006.1632754openalex-snapshot
A New d=1, k=10 Soft-Decodable RLL Code with r=2 MTR-Constraint and a 2-to-3 PCWA Mapping for DC-Control
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.