On the public citation graph

Bounds on the number of states in encoder graphs for input-constrained channels

0 signed · 95 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.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.1007/0-387-32792-4openalex-snapshot
Non-negative Matrices and Markov Chains
inferredcites →https://doi.org/10.1007/978-3-642-05156-2openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.1007/bf01319913openalex-snapshot
Sofic systems and graphs
inferredcites →https://doi.org/10.1016/0024-3795(87)90081-4openalex-snapshot
On the Perron-Frobenius eigenvector for nonnegative integral matrices whose largest eigenvalue is integral
inferredcites →https://doi.org/10.1109/18.2597openalex-snapshot
Sliding-block coding for input-restricted channels
inferredcites →https://doi.org/10.1109/18.45296openalex-snapshot
Minimum scope for sliding block decoder mappings
inferredcites →https://doi.org/10.1109/18.53736openalex-snapshot
The method of poles: a coding method for constrained channels
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/18.79946openalex-snapshot
Variable-length state splitting with applications to average runlength-constrained (ARC) codes
inferredcites →https://doi.org/10.1109/18.79960openalex-snapshot
A new rate 2/3 sliding block code for the
inferredcites →https://doi.org/10.1109/pgec.1965.263996openalex-snapshot
On Information Lossless Automata of Finite Order
inferredcites →https://doi.org/10.1109/tct.1959.1086614openalex-snapshot
Canonical Forms for Information-Lossless Finite-State Logical Machines
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.1147/rd.264.0506openalex-snapshot
Construction of Bounded Delay Codes for Discrete Noiseless Channels
inferredcites →https://doi.org/10.1147/rd.331.0060openalex-snapshot
Statistical properties of selected recording codes
inferredcites →https://doi.org/10.1147/rd.336.0602openalex-snapshot
Coding for constrained channels: A comparison of two approaches
inferredcites →https://doi.org/10.2307/2003862openalex-snapshot
Matrix Iterative Analysis
inferredcites →https://doi.org/10.2307/2982031openalex-snapshot
Non-Negative Matrices and Markov Chains.

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-0-387-30440-3_531openalex-snapshot
Symbolic Dynamics
inferred← citeshttps://doi.org/10.1007/978-1-0716-2388-6_531openalex-snapshot
Symbolic Dynamics
inferred← citeshttps://doi.org/10.1007/978-1-4419-5569-2_8openalex-snapshot
Constrained Coding for Optical Communication
inferred← citeshttps://doi.org/10.1007/978-1-4614-1806-1_108openalex-snapshot
Symbolic Dynamics
inferred← citeshttps://doi.org/10.1007/978-1-4757-2471-4_4openalex-snapshot
Baseband Modulation Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-10391-9_6openalex-snapshot
Finitely Generated Groups
inferred← citeshttps://doi.org/10.1007/978-3-642-27737-5_531-2openalex-snapshot
Symbolic Dynamics
inferred← citeshttps://doi.org/10.1016/0304-3975(96)00058-8openalex-snapshot
Sofic shifts with synchronizing presentations
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00109-1openalex-snapshot
On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels
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.003openalex-snapshot
Shift Spaces
inferred← citeshttps://doi.org/10.1017/9781108899727.004openalex-snapshot
Shifts of Finite Type
inferred← citeshttps://doi.org/10.1017/9781108899727.005openalex-snapshot
Sofic Shifts
inferred← citeshttps://doi.org/10.1017/9781108899727.006openalex-snapshot
Entropy
inferred← citeshttps://doi.org/10.1017/9781108899727.007openalex-snapshot
Finite-State Codes
inferred← citeshttps://doi.org/10.1017/9781108899727.008openalex-snapshot
Shifts as Dynamical Systems
inferred← citeshttps://doi.org/10.1017/9781108899727.009openalex-snapshot
Conjugacy
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/9781108899727.013openalex-snapshot
Realization
inferred← citeshttps://doi.org/10.1017/9781108899727.014openalex-snapshot
Equal Entropy Factors
inferred← citeshttps://doi.org/10.1017/9781108899727.015openalex-snapshot
Guide to Advanced Topics
inferred← citeshttps://doi.org/10.1017/9781108899727.016openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1017/9781108899727.017openalex-snapshot
Addendum Bibliography
inferred← citeshttps://doi.org/10.1017/9781108899727.018openalex-snapshot
Notation Index
inferred← citeshttps://doi.org/10.1017/9781108899727.019openalex-snapshot
Index
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.003openalex-snapshot
SHIFTS OF FINITE TYPE
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.013openalex-snapshot
EQUAL ENTROPY FACTORS
inferred← citeshttps://doi.org/10.1017/cbo9780511626302.014openalex-snapshot
GUIDE TO ADVANCED TOPICS
inferred← citeshttps://doi.org/10.1109/18.335934openalex-snapshot
A block-decodable (1,8) runlength-limited rate 8/12 code
inferred← citeshttps://doi.org/10.1109/18.340457openalex-snapshot
Minimal presentations for irreducible sofic shifts
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.412672openalex-snapshot
Trellis group codes for the Gaussian channel
inferred← citeshttps://doi.org/10.1109/18.412682openalex-snapshot
On the construction of bounded-delay encodable codes for constrained systems
inferred← citeshttps://doi.org/10.1109/18.556125openalex-snapshot
The construction of M-ary (d,∞) codes that achieve capacity and have the fewest number of encoder states
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.623173openalex-snapshot
On an approximate eigenvector associated with a modulation code
inferred← citeshttps://doi.org/10.1109/18.720539openalex-snapshot
Codes for digital recorders
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.79946openalex-snapshot
Variable-length state splitting with applications to average runlength-constrained (ARC) codes
inferred← citeshttps://doi.org/10.1109/18.79960openalex-snapshot
A new rate 2/3 sliding block code for the
inferred← citeshttps://doi.org/10.1109/18.850670openalex-snapshot
Nested input-constrained codes
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/18.995538openalex-snapshot
Parallel constrained coding with application to two-dimensional constraints
inferred← citeshttps://doi.org/10.1109/20.490275openalex-snapshot
A new design of EFM constrained codes
inferred← citeshttps://doi.org/10.1109/20.573871openalex-snapshot
Five runlength-limited codes for M-ary recording 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/49.124480openalex-snapshot
Prefix-synchronized run-length-limited sequences
inferred← citeshttps://doi.org/10.1109/49.920171openalex-snapshot
Maximum transition run codes for generalized partial response channels
inferred← citeshttps://doi.org/10.1109/eeis.1995.514174openalex-snapshot
Coding for magnetic and optical recording
inferred← citeshttps://doi.org/10.1109/isit.1994.394832openalex-snapshot
On the decoding delay of encoders for input-constrained channels
inferred← citeshttps://doi.org/10.1109/isit.1997.613055openalex-snapshot
Lower bounds on the anticipation of encoders for input-constrained channels
inferred← citeshttps://doi.org/10.1109/isit.2006.261996openalex-snapshot
On Row-by-Row Coding for 2-D Constraints
inferred← citeshttps://doi.org/10.1109/isit.2018.8437351openalex-snapshot
On Parity-Preserving Constrained Coding
inferred← citeshttps://doi.org/10.1109/isita.2008.4895477openalex-snapshot
Modulation codes for reader-tag communication on inductively coupled channels
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2873345openalex-snapshot
Minimal Sets for Capacity-Approaching Variable-Length Constrained Sequence Codes
inferred← citeshttps://doi.org/10.1109/tit.2009.2023754openalex-snapshot
On Row-by-Row Coding for 2-D Constraints
inferred← citeshttps://doi.org/10.1109/tit.2012.2201370openalex-snapshot
Coding for Inductively Coupled Channels
inferred← citeshttps://doi.org/10.1109/tit.2020.3042958openalex-snapshot
On Bi-Modal Constrained Coding
inferred← citeshttps://doi.org/10.1117/12.464086openalex-snapshot
Constrained coding for the deep-space optical channel
inferred← citeshttps://doi.org/10.1137/s0895480193244310openalex-snapshot
Canonical Encoders for Sliding Block Decoders
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3849497/v1openalex-snapshot
On Duplication-Free Codes for Disjoint or Equal-Length Errors
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0596openalex-snapshot
On row-by-row coding for 2-D constraints
inferred← citeshttps://doi.org/10.6100/ir624659openalex-snapshot
Design and analysis of parity-check-code-based optical recording 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.