On the public citation graph

On runlength codes

0 signed · 139 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.tb01338.xopenalex-snapshot
A Mathematical Theory of Communication
inferredcites →https://doi.org/10.1016/0016-0032(58)90688-4openalex-snapshot
An introduction to probability theory and its applications
inferredcites →https://doi.org/10.1049/ep.1964.0233openalex-snapshot
Linear System Theory: the State Space Approach
inferredcites →https://doi.org/10.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1049/sqj.1964.0048openalex-snapshot
Linear System Theory: The State Space Approach
inferredcites →https://doi.org/10.2307/2344305openalex-snapshot
Information Theory and Reliable Communication.
inferredcites →https://doi.org/10.2307/2980979openalex-snapshot
An Introduction to Probability Theory and its Applications.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/ecjc.4430770205openalex-snapshot
Systematic construction algorithm of fixed block‐length (d, k) codes
inferred← citeshttps://doi.org/10.1002/ecjc.4430780111openalex-snapshot
Systematic construction algorithm of fixed block‐length multitrack (d, k) Codes
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.1002/sat.4600060212openalex-snapshot
Error correction, interleaving and differential pulse position modulation
inferred← citeshttps://doi.org/10.1007/978-1-4614-8033-4_48openalex-snapshot
On the Exact Distributions of Pattern Statistics for a Sequence of Binary Trials: A Combinatorial Approach
inferred← citeshttps://doi.org/10.1007/978-1-4614-8414-1_48-1openalex-snapshot
On the Exact Distributions of Pattern Statistics for a Sequence of Binary Trials: A Combinatorial Approach
inferred← citeshttps://doi.org/10.1007/978-94-009-2794-0_21openalex-snapshot
Modulation and Coding for the Magnetic Recording Channel
inferred← citeshttps://doi.org/10.1007/s00362-012-0462-1openalex-snapshot
Exact distributions of constrained (k, ℓ) strings of failures between subsequent successes
inferred← citeshttps://doi.org/10.1016/b978-0-12-374449-4.00011-8openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/b978-0-12-374449-4.00014-3openalex-snapshot
Format of 802.11 Packets
inferred← citeshttps://doi.org/10.1016/j.camwa.2009.07.057openalex-snapshot
On the distribution of runs of ones in binary strings
inferred← citeshttps://doi.org/10.1017/cbo9780511843204openalex-snapshot
Analytic Pattern Matching
inferred← citeshttps://doi.org/10.1049/el:19920418openalex-snapshot
Spectra of maxentropic interleaved RLL sequences
inferred← citeshttps://doi.org/10.1049/el:19920780openalex-snapshot
Spectra of maxentropic CCRLL sequences: Markov chain model and efficient algorithm for the calculation
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.11.3148openalex-snapshot
MAP Detectors for Differential Pulse-Position Modulation over Indoor Optical Wireless Communications
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.144702openalex-snapshot
Improved Gilbert-Varshamov bound for constrained systems
inferred← citeshttps://doi.org/10.1109/18.144720openalex-snapshot
The (d,k) subcode of a linear block code
inferred← citeshttps://doi.org/10.1109/18.212300openalex-snapshot
Perfect (d,k)-codes capable of correcting single peak-shifts
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.661518openalex-snapshot
Shannon capacity of M-ary redundant multitrack runlength limited codes
inferred← citeshttps://doi.org/10.1109/18.681334openalex-snapshot
Spectral analysis of maximum entropy multitrack modulation codes
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.782173openalex-snapshot
An enumerative method for runlength-limited codes: permutation codes
inferred← citeshttps://doi.org/10.1109/18.79941openalex-snapshot
On the capacity of the noisy runlength channel
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.79947openalex-snapshot
Generating functions and lower bounds on rates for limited error-correcting codes
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/18.841167openalex-snapshot
Distance-spectrum formulas on the largest minimum distance of block codes
inferred← citeshttps://doi.org/10.1109/18.930945openalex-snapshot
Optimal block codes for M-ary runlength-constrained channels
inferred← citeshttps://doi.org/10.1109/2.55471openalex-snapshot
Fundamentals of bar code information theory
inferred← citeshttps://doi.org/10.1109/26.328978openalex-snapshot
Achievable performance over the correlated Rician channel
inferred← citeshttps://doi.org/10.1109/26.35370openalex-snapshot
The power spectrum of run-length-limited codes
inferred← citeshttps://doi.org/10.1109/26.54971openalex-snapshot
On the capacity of binary and Gaussian channels with run-length-limited inputs
inferred← citeshttps://doi.org/10.1109/26.705399openalex-snapshot
Coded modulation and precoding for electron-trapping optical memories
inferred← citeshttps://doi.org/10.1109/49.124482openalex-snapshot
On the cutoff rate of a discrete memoryless channel with (d, k)-constrained input sequences
inferred← citeshttps://doi.org/10.1109/49.124483openalex-snapshot
Maximum entropy charge-constrained run-length codes
inferred← citeshttps://doi.org/10.1109/49.124484openalex-snapshot
Two-dimensional modulation codes
inferred← citeshttps://doi.org/10.1109/5.63306openalex-snapshot
Runlength-limited sequences
inferred← citeshttps://doi.org/10.1109/access.2018.2844278openalex-snapshot
Ultra-Short-Term Multistep Wind Power Prediction Based on Improved EMD and Reconstruction Method Using Run-Length Analysis
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/access.2024.3376476openalex-snapshot
Quasi-Enumerative Coding of Balanced Run-Length Limited Codes
inferred← citeshttps://doi.org/10.1109/acssc.1989.1200836openalex-snapshot
Cut-off rate of a discrete memoryless channel with (d,k) constrained input sequences
inferred← citeshttps://doi.org/10.1109/acssc.2016.7869654openalex-snapshot
Information-theoretic analysis of refractory effects in the P300 speller
inferred← citeshttps://doi.org/10.1109/allerton.2015.7446999openalex-snapshot
The feedback capacity of the binary symmetric channel with a no-consecutive-ones input constraint
inferred← citeshttps://doi.org/10.1109/comsig.1989.129026openalex-snapshot
Low bitrate coding for storage of ID photos
inferred← citeshttps://doi.org/10.1109/dsn.2011.5958260openalex-snapshot
A combinatorial approach to network covert communications with applications in Web Leaks
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.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.1991.188734openalex-snapshot
DC free runlength-limited codes
inferred← citeshttps://doi.org/10.1109/glocom.2001.965977openalex-snapshot
On the capacity of Markov sources over noisy channels
inferred← citeshttps://doi.org/10.1109/glocom.2011.6134474openalex-snapshot
Time-Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.1109/icc.1992.268121openalex-snapshot
On the capacity of the (d, k) constrained BSC: computed bounds and estimates
inferred← citeshttps://doi.org/10.1109/iccd.1990.130205openalex-snapshot
Digital magnetic recording systems
inferred← citeshttps://doi.org/10.1109/icuwb.2017.8250992openalex-snapshot
Pathways towards Tb/s wireless
inferred← citeshttps://doi.org/10.1109/isit.2000.866438openalex-snapshot
Optimal block codes for M-ary runlength-limited channels
inferred← citeshttps://doi.org/10.1109/isit.2004.1365227openalex-snapshot
An improvement to the bit stuffing algorithm
inferred← citeshttps://doi.org/10.1109/isit.2005.1523394openalex-snapshot
A fixed-rate bit stuffing approach for high efficiency k-constrained codes
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/isit.2006.262117openalex-snapshot
Optimal Parsing Trees for Run-Length Coding of Biased Data
inferred← citeshttps://doi.org/10.1109/isit.2007.4557352openalex-snapshot
Noisy Constrained Capacity
inferred← citeshttps://doi.org/10.1109/isit.2007.4557611openalex-snapshot
Pattern Matching in Constrained Sequences
inferred← citeshttps://doi.org/10.1109/isit.2009.5205785openalex-snapshot
Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR
inferred← citeshttps://doi.org/10.1109/isit.2009.5205832openalex-snapshot
Coded modulation with a constraint on the minimum channel symbol duration
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/isit.2013.6620599openalex-snapshot
Concavity of mutual information rate of finite-state channels
inferred← citeshttps://doi.org/10.1109/isit.2014.6874981openalex-snapshot
Constrained codes for joint energy and information transfer with receiver energy utilization requirements
inferred← citeshttps://doi.org/10.1109/isit.2018.8437345openalex-snapshot
Skip-Sliding Window Codes
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174165openalex-snapshot
Computable Lower Bounds for Capacities of Input-Driven Finite-State Channels
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834876openalex-snapshot
On the Performance of Reed-Muller Codes Over (d, ∞)-RLL Input-Constrained BMS Channels
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206809openalex-snapshot
Locally Mitigating Sneak-Path Interference in Resistive Memory Arrays
inferred← citeshttps://doi.org/10.1109/isit57864.2024.10619166openalex-snapshot
Capacity of Runlength-Limited and GC-Content Constrained Codes for DNA Data Storage
inferred← citeshttps://doi.org/10.1109/isit62367.2026.11654058openalex-snapshot
Recoverable systems and the maximal hard-core model on the square and triangular lattices
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.1998.706448openalex-snapshot
Asymptotically efficient, binary-compatible block codes for M-ary runlength-limited constraints
inferred← citeshttps://doi.org/10.1109/itw.2009.5351376openalex-snapshot
Finite-state wiretap channels: Secrecy under memory constraints
inferred← citeshttps://doi.org/10.1109/itw.2015.7133107openalex-snapshot
Capacity of the (1, ∞)-RLL input-constrained erasure channel with feedback
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611467openalex-snapshot
Asymptotics of Constant-Weight Constrained Sequences with Applications
inferred← citeshttps://doi.org/10.1109/iwqos.2011.5931353openalex-snapshot
Designing efficient codes for synchronization error channels
inferred← citeshttps://doi.org/10.1109/jproc.2018.2795961openalex-snapshot
Signal Processing and Coding Techniques for 2-D Magnetic Recording: An Overview
inferred← citeshttps://doi.org/10.1109/mbits.2023.3336213openalex-snapshot
Channels Engineering in Magnetic Recording: From Theory to Practice
inferred← citeshttps://doi.org/10.1109/milcom.1988.13460openalex-snapshot
Trellis codes for recording
inferred← citeshttps://doi.org/10.1109/pimrc.1991.571466openalex-snapshot
Spectral Analysis Of RLL Codes Modulated By FSK Or CPM
inferred← citeshttps://doi.org/10.1109/rait.2012.6194501openalex-snapshot
Energy-efficient communication: Understanding the distribution of runs in binary strings
inferred← citeshttps://doi.org/10.1109/sicon.1995.526071openalex-snapshot
Multistage coding for data storage systems
inferred← citeshttps://doi.org/10.1109/spcom.2016.7746649openalex-snapshot
The feedback capacity of the BIBO channel with a no-consecutive-ones input constraint
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.2007.892443openalex-snapshot
On the Power Spectral Density of Constrained Sequences
inferred← citeshttps://doi.org/10.1109/tcomm.2014.2317480openalex-snapshot
Constrained Codes for Joint Energy and Information Transfer
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3058965openalex-snapshot
Skip-Sliding Window Codes
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.2004.833349openalex-snapshot
Constraint Gain
inferred← citeshttps://doi.org/10.1109/tit.2005.851764openalex-snapshot
An Improvement to the Bit Stuffing Algorithm
inferred← citeshttps://doi.org/10.1109/tit.2005.860473openalex-snapshot
Timing metrics for constrained codes
inferred← citeshttps://doi.org/10.1109/tit.2006.876224openalex-snapshot
Capacity achieving code constructions for two classes of (d,k) constraints
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.901203openalex-snapshot
Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
inferred← citeshttps://doi.org/10.1109/tit.2007.913570openalex-snapshot
Optimal Parsing Trees for Run-Length Coding of Biased Data
inferred← citeshttps://doi.org/10.1109/tit.2008.2008155openalex-snapshot
Reliable Communication in the Absence of a Common Clock
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.2011.2145490openalex-snapshot
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
inferred← citeshttps://doi.org/10.1109/tit.2011.2172725openalex-snapshot
A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences
inferred← citeshttps://doi.org/10.1109/tit.2011.2173730openalex-snapshot
Concavity of the Mutual Information Rate for Input-Restricted Memoryless Channels at High SNR
inferred← citeshttps://doi.org/10.1109/tit.2013.2257916openalex-snapshot
Time–Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.1109/tit.2015.2423558openalex-snapshot
Analyticity of Entropy Rate of Hidden Markov Chains With Continuous Alphabet
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.2015.2495239openalex-snapshot
The Feedback Capacity of the Binary Erasure Channel With a No-Consecutive-Ones Input Constraint
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.2016.2596281openalex-snapshot
Extensions of the I-MMSE Relationship to Gaussian Channels With Feedback and Memory
inferred← citeshttps://doi.org/10.1109/tit.2017.2742498openalex-snapshot
Asymptotics of Input-Constrained Erasure Channel Capacity
inferred← citeshttps://doi.org/10.1109/tit.2018.2809554openalex-snapshot
Feedback Capacity and Coding for the BIBO Channel With a No-Repeated-Ones Input Constraint
inferred← citeshttps://doi.org/10.1109/tit.2018.2854601openalex-snapshot
Subset Source Coding
inferred← citeshttps://doi.org/10.1109/tit.2019.2940256openalex-snapshot
Reconstruction Codes for DNA Sequences With Uniform Tandem-Duplication Errors
inferred← citeshttps://doi.org/10.1109/tit.2021.3134871openalex-snapshot
Asymptotic Behavior and Typicality Properties of Runlength-Limited Sequences
inferred← citeshttps://doi.org/10.1109/tit.2022.3179029openalex-snapshot
Zero-Error Feedback Capacity for Bounded Stabilization and Finite-State Additive Noise Channels
inferred← citeshttps://doi.org/10.1109/tit.2023.3296207openalex-snapshot
Coding Schemes Based on Reed-Muller Codes for (d, ∞)-RLL Input-Constrained Channels
inferred← citeshttps://doi.org/10.1109/tit.2023.3304408openalex-snapshot
Capacity of Finite-State Channels With Delayed Feedback
inferred← citeshttps://doi.org/10.1109/tit.2024.3515896openalex-snapshot
On DNA Synthesis Using Shortmers and the Capacity of Non-Deterministic Costly Constrained Graphs
inferred← citeshttps://doi.org/10.1145/1921659.1921671openalex-snapshot
Constrained pattern matching
inferred← citeshttps://doi.org/10.1147/rd.331.0060openalex-snapshot
Statistical properties of selected recording codes
inferred← citeshttps://doi.org/10.1155/2014/646140openalex-snapshot
On the Expected Number of Limited Length Binary Strings Derived by Certain Urn Models
inferred← citeshttps://doi.org/10.1214/08-aap570openalex-snapshot
Asymptotics of input-constrained binary symmetric channel capacity
inferred← citeshttps://doi.org/10.1364/ods.1998.md.5openalex-snapshot
Tradeoffs in binary and nonbinary optical recording
inferred← citeshttps://doi.org/10.46298/dmtcs.382openalex-snapshot
Waiting time distributions for pattern occurrence in a constrained sequence
inferred← citeshttps://doi.org/10.46298/dmtcs.449openalex-snapshot
Waiting Time Distribution for Pattern Occurrence in a Constrained Sequence: an Embedding Markov Chain Approach
inferred← citeshttps://doi.org/10.48550/arxiv.1207.4530openalex-snapshot
Time-Space Constrained Codes for Phase-Change Memories
inferred← citeshttps://doi.org/10.48550/arxiv.1701.03313openalex-snapshot
Information-Theoretic Analysis of Refractory Effects in the P300 Speller
inferred← citeshttps://doi.org/10.48550/arxiv.1711.09494openalex-snapshot
Skip-Sliding Window Codes
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.