On the public citation graph
Minimum scope for sliding block decoder mappings
0 signed · 48 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.1002/j.1538-7305.1948.tb00917.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1002/j.1538-7305.1948.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1109/18.556684openalex-snapshot
A linear bound for sliding-block decoder window size. II
inferredcites →https://doi.org/10.1109/18.6020openalex-snapshot
A linear bound for sliding-block decoder window size
inferredcites →https://doi.org/10.1109/tcom.1971.1090770openalex-snapshot
A Survey of Coding Schemes for Transmission or Recording of Digital Data
inferredcites →https://doi.org/10.1109/tit.1982.1056581openalex-snapshot
Look-ahead coding for input- restricted channels (Corresp.)
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/tit.1985.1057037openalex-snapshot
Sofic systems and encoding data
inferredcites →https://doi.org/10.1147/rd.245.0638openalex-snapshot
A General Method for Channel Coding
inferredcites →https://doi.org/10.1147/rd.264.0506openalex-snapshot
Construction of Bounded Delay Codes for Discrete Noiseless Channels
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-4419-5569-2_8openalex-snapshot
Constrained Coding for Optical Communication
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.370118openalex-snapshot
Construction of encoders with small decoding look-ahead for input-constrained channels
inferred← citeshttps://doi.org/10.1109/18.556686openalex-snapshot
On the decoding delay of encoders for input-constrained channels
inferred← citeshttps://doi.org/10.1109/18.782099openalex-snapshot
Constrained coding for binary channels with high intersymbol interference
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/49.124467openalex-snapshot
Finite-state modulation codes for data storage
inferred← citeshttps://doi.org/10.1109/eeis.1995.514174openalex-snapshot
Coding for magnetic and optical recording
inferred← citeshttps://doi.org/10.1137/s0895480193244310openalex-snapshot
Canonical Encoders for Sliding Block Decoders
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.