On the public citation graph
On the construction of bounded-delay encodable codes for constrained systems
0 signed · 65 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.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1090/s0002-9939-1985-0806078-7openalex-snapshot
A Note on Minimal Covers for Sofic Systems
inferredcites →https://doi.org/10.1109/18.2597openalex-snapshot
Sliding-block coding for input-restricted channels
inferredcites →https://doi.org/10.1109/18.335934openalex-snapshot
A block-decodable (1,8) runlength-limited rate 8/12 code
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/18.79946openalex-snapshot
Variable-length state splitting with applications to average runlength-constrained (ARC) codes
inferredcites →https://doi.org/10.1109/49.124467openalex-snapshot
Finite-state modulation codes for data storage
inferredcites →https://doi.org/10.1109/isit.1993.748317openalex-snapshot
Block-Decodable Runlength-Limited Codes via Look-Ahead Technique
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.1986.1057125openalex-snapshot
State splitting for variable-length graphs (Corresp.)
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage
inferredcites →https://doi.org/10.1137/s0895480193244310openalex-snapshot
Canonical Encoders for Sliding Block Decoders
inferredcites →https://doi.org/10.1147/rd.231.0075openalex-snapshot
On Future-Dependent Block Coding for Input-Restricted Channels
inferredcites →https://doi.org/10.1147/rd.241.0043openalex-snapshot
Synchronous Bounded Delay Coding for Input Restricted Channels
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
inferredcites →https://doi.org/10.1147/rd.336.0602openalex-snapshot
Coding for constrained channels: A comparison of two approaches
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/0471219282.eot341openalex-snapshot
Constrained Coding Techniques for Data Storage
inferred← citeshttps://doi.org/10.1007/978-1-4757-2471-4_4openalex-snapshot
Baseband Modulation Codes
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.556686openalex-snapshot
On the decoding delay of encoders for input-constrained channels
inferred← citeshttps://doi.org/10.1109/18.556687openalex-snapshot
Bounded-delay-encodable, block-decodable codes for constrained systems
inferred← citeshttps://doi.org/10.1109/18.605603openalex-snapshot
A generalized state-splitting algorithm
inferred← citeshttps://doi.org/10.1109/18.623173openalex-snapshot
On an approximate eigenvector associated with a modulation code
inferred← citeshttps://doi.org/10.1109/18.841181openalex-snapshot
Time-varying encoders for constrained systems: an approach to limiting error propagation
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/26.681399openalex-snapshot
Two-dimensional low-pass filtering codes
inferred← citeshttps://doi.org/10.1109/30.920465openalex-snapshot
Combi-codes for DC-free runlength-limited coding
inferred← citeshttps://doi.org/10.1109/isit.1994.394833openalex-snapshot
A construction method for bounded-delay encodable modulation codes
inferred← citeshttps://doi.org/10.1109/isit.1997.613060openalex-snapshot
The approximate eigenvector associated with a modulation code
inferred← citeshttps://doi.org/10.1109/tit.2003.811920openalex-snapshot
Extensions of the method of poles for code construction
inferred← citeshttps://doi.org/10.1109/tit.2005.853331openalex-snapshot
An Analysis on Optimal Rates of BDB Encoders for RLL and MTR Systems
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.