On the public citation graph
On the capacity of binary and Gaussian channels with run-length-limited inputs
0 signed · 45 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.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1109/18.42224openalex-snapshot
Extension of an entropy property for binary input memoryless symmetric channels
inferredcites →https://doi.org/10.1109/20.3405openalex-snapshot
Signaling with special run-length constraints for a digital recording channel
inferredcites →https://doi.org/10.1109/tcom.1975.1092898openalex-snapshot
Surprising Properties of Two-Level "Bandwidth Compaction" Codes
inferredcites →https://doi.org/10.1109/tit.1973.1055107openalex-snapshot
A theorem on the entropy of certain binary sequences and applications--I
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/tmag.1981.1061721openalex-snapshot
Channel capacity of charge-constrained run-length limited codes
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ett.4460040210openalex-snapshot
Bounds on the Cut‐Off Rate of the Peak Shift Magnetic Recording Channel
inferred← citeshttps://doi.org/10.1002/ett.4460070309openalex-snapshot
Upper bounds on the size of error‐correcting runlength‐limited codes
inferred← citeshttps://doi.org/10.1109/18.104315openalex-snapshot
On the capacity of a direct-detection photon channel with intertransition-constrained binary input
inferred← citeshttps://doi.org/10.1109/18.333860openalex-snapshot
Lower bounds on achievable rates for limited bitshift correcting codes
inferred← citeshttps://doi.org/10.1109/18.42224openalex-snapshot
Extension of an entropy property for binary input memoryless symmetric channels
inferred← citeshttps://doi.org/10.1109/18.59938openalex-snapshot
A binary analog to the entropy-power inequality
inferred← citeshttps://doi.org/10.1109/18.782123openalex-snapshot
Bounds on the information rate of intertransition-time-restricted binary signaling over an AWGN channel
inferred← citeshttps://doi.org/10.1109/18.79941openalex-snapshot
On the capacity of the noisy runlength channel
inferred← citeshttps://doi.org/10.1109/18.79953openalex-snapshot
Bounds on the capacity of the bit-shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/access.2019.2892989openalex-snapshot
On the Capacity of a Two-Hop Half-Duplex Relay Channel With a Markovian Constrained Relay
inferred← citeshttps://doi.org/10.1109/eeis.1989.720029openalex-snapshot
On the Capacity of Binary and Gaussian Channels with Run-Length Limited Inputs
inferred← citeshttps://doi.org/10.1109/eeis.1991.217657openalex-snapshot
Bounds on the capacity of a binary input AWGN channel with intertransition duration restrictions
inferred← citeshttps://doi.org/10.1109/eeis.1991.217738openalex-snapshot
Bounds on the cut-off rate of the peak shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/glocom.1990.116788openalex-snapshot
Bounds on the capacity of the peak shift magnetic recording channel
inferred← citeshttps://doi.org/10.1109/glocom.1992.276362openalex-snapshot
Achievable radial information densities in magnetic recording systems
inferred← citeshttps://doi.org/10.1109/isit.1993.748551openalex-snapshot
Asymptotic Bounds on the Rates of Runlength-Limited Codes
inferred← citeshttps://doi.org/10.1109/isit.2004.1365383openalex-snapshot
Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels
inferred← citeshttps://doi.org/10.1109/isit.2013.6620598openalex-snapshot
A randomized approach to the capacity of finite-state channels
inferred← citeshttps://doi.org/10.1109/ita.2014.6804257openalex-snapshot
On code design for simultaneous energy and information transfer
inferred← citeshttps://doi.org/10.1109/itw.2009.5351376openalex-snapshot
Finite-state wiretap channels: Secrecy under memory constraints
inferred← citeshttps://doi.org/10.1109/tcomm.2012.071312.110682openalex-snapshot
Low-Precision A/D Conversion for Maximum Information Rate in Channels with Memory
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2317480openalex-snapshot
Constrained Codes for Joint Energy and Information Transfer
inferred← citeshttps://doi.org/10.1109/tgcn.2019.2919780openalex-snapshot
Are Run-Length Limited Codes Suitable for Simultaneous Energy and Information Transfer?
inferred← citeshttps://doi.org/10.1109/tit.2006.878110openalex-snapshot
Simulation-Based Computation of Information Rates for Channels With Memory
inferred← citeshttps://doi.org/10.1109/tit.2007.915709openalex-snapshot
Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels
inferred← citeshttps://doi.org/10.1109/tit.2008.920243openalex-snapshot
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels
inferred← citeshttps://doi.org/10.1109/tit.2010.2069170openalex-snapshot
Noisy Constrained Capacity for BSC Channels
inferred← citeshttps://doi.org/10.1109/tit.2015.2432094openalex-snapshot
A Randomized Algorithm for the Capacity of Finite-State Channels
inferred← citeshttps://doi.org/10.1109/tit.2016.2559504openalex-snapshot
Subblock-Constrained Codes for Real-Time Simultaneous Energy and Information Transfer
inferred← citeshttps://doi.org/10.1109/tit.2026.3660255openalex-snapshot
Volume-Based Lower Bounds to the Capacity of the Gaussian Channel Under Pointwise Additive Input Constraints
inferred← citeshttps://doi.org/10.1214/08-aap570openalex-snapshot
Asymptotics of input-constrained binary symmetric channel capacity
inferred← citeshttps://doi.org/10.48550/arxiv.1807.09040openalex-snapshot
Are RLL Codes Suitable for Simultaneous Energy and Information Transfer?
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.