On the public citation graph
Variable-length state splitting with applications to average runlength-constrained (ARC) codes
0 signed · 79 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.1007/bf01295238openalex-snapshot
Factors and extensions of full shifts
inferredcites →https://doi.org/10.1109/18.2597openalex-snapshot
Sliding-block coding for input-restricted channels
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/tit.1984.1056939openalex-snapshot
Maxentropic Markov chains (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1986.1057125openalex-snapshot
State splitting for variable-length graphs (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057326openalex-snapshot
A note on the Shannon capacity of run-length-limited codes (Corresp.)
inferredcites →https://doi.org/10.1109/tit.1987.1057385openalex-snapshot
Conditional limit theorems under Markov conditioning
inferredcites →https://doi.org/10.1109/tmag.1987.1065196openalex-snapshot
Results involving (D,K) constrained M-ary codes
inferredcites →https://doi.org/10.1147/rd.194.0366openalex-snapshot
Zero-Modulation Encoding in Magnetic Recording
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.1007/978-1-4613-8354-3_1openalex-snapshot
Symbolic Dynamics and Matrices
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.1049/el:19930951openalex-snapshot
Prefix synchronised RLL sequences: variable-length graph model
inferred← citeshttps://doi.org/10.1090/memo/0910openalex-snapshot
A proof of Alon’s second eigenvalue conjecture and related problems
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.412682openalex-snapshot
On the construction of bounded-delay encodable codes for constrained systems
inferred← citeshttps://doi.org/10.1109/18.490550openalex-snapshot
Coding for channels with cost constraints
inferred← citeshttps://doi.org/10.1109/18.681334openalex-snapshot
Spectral analysis of maximum entropy multitrack modulation codes
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.841181openalex-snapshot
Time-varying encoders for constrained systems: an approach to limiting error propagation
inferred← citeshttps://doi.org/10.1109/20.560123openalex-snapshot
DC-free run-length-limited codes for magnetic recording
inferred← citeshttps://doi.org/10.1109/26.618298openalex-snapshot
Coaxial cable passive mesh networks
inferred← citeshttps://doi.org/10.1109/35.120352openalex-snapshot
Spectral nulls and coding with large alphabets
inferred← citeshttps://doi.org/10.1109/49.124467openalex-snapshot
Finite-state modulation codes for data storage
inferred← citeshttps://doi.org/10.1109/49.124483openalex-snapshot
Maximum entropy charge-constrained run-length codes
inferred← citeshttps://doi.org/10.1109/access.2019.2913339openalex-snapshot
Construction of Multi-State Capacity-Approaching Variable-Length Constrained Sequence Codes With State-Independent Decoding
inferred← citeshttps://doi.org/10.1109/eeis.1995.514174openalex-snapshot
Coding for magnetic and optical recording
inferred← citeshttps://doi.org/10.1109/icc.1994.368726openalex-snapshot
Error-correcting two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/isit.1991.695317openalex-snapshot
Variable Length Trellis Decoding
inferred← citeshttps://doi.org/10.1109/isit.2004.1365304openalex-snapshot
Average transition density constraints for mitigating transition noise in magnetic recording
inferred← citeshttps://doi.org/10.1109/isit.2006.262110openalex-snapshot
On the Capacity of Precision-Resolution Constrained Systems
inferred← citeshttps://doi.org/10.1109/isit.2006.262115openalex-snapshot
On (d, k) Sequences Not Containing a Given Word
inferred← citeshttps://doi.org/10.1109/milcom.1988.13460openalex-snapshot
Trellis codes for recording
inferred← citeshttps://doi.org/10.1109/ssap.1996.534918openalex-snapshot
The power spectral density of maximum entropy M-ary (d, k) codes
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.2003.811920openalex-snapshot
Extensions of the method of poles for code construction
inferred← citeshttps://doi.org/10.1109/tit.2009.2039089openalex-snapshot
On the Capacity of the Precision-Resolution System
inferred← citeshttps://doi.org/10.1109/tit.2020.2986318openalex-snapshot
Rate-Constrained Shaping Codes for Structured Sources
inferred← citeshttps://doi.org/10.1109/tit.2020.3042958openalex-snapshot
On Bi-Modal Constrained Coding
inferred← citeshttps://doi.org/10.1109/tit.2021.3095395openalex-snapshot
Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case
inferred← citeshttps://doi.org/10.1142/9789812837172openalex-snapshot
Selected Topics in Information and Coding Theory
inferred← citeshttps://doi.org/10.1142/9789812837172_0012openalex-snapshot
VARIABLE-LENGTH CODES AND FINITE AUTOMATA
inferred← citeshttps://doi.org/10.1201/9781420041545-36openalex-snapshot
A Read Channel for Magnetic Recording
inferred← citeshttps://doi.org/10.1561/0100000132openalex-snapshot
Maximizing Entropy with an Expectation Constraint and One-Parameter Exponential Families of Distributions: A Reexamination
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.3311/pp.ee.2009-1-2.04openalex-snapshot
A joint coding concept for runlength and charge–limited channels
inferred← citeshttps://doi.org/10.7907/6f03-mp11openalex-snapshot
Interval modulation: a new paradigm for the design of high speed optical communication 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.