On the public citation graph
Bounds on the capacity of the bit-shift magnetic recording channel
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.1049/ep.1969.0319openalex-snapshot
Information Theory and Reliable Communication
inferredcites →https://doi.org/10.1109/18.42229openalex-snapshot
Hamming distance preserving mappings and trellis codes with constrained binary symbols
inferredcites →https://doi.org/10.1109/20.104705openalex-snapshot
Analysis of asymmetric deterministic bitshift errors in a hard disk file
inferredcites →https://doi.org/10.1109/20.42533openalex-snapshot
Distance preserving run-length limited codes
inferredcites →https://doi.org/10.1109/20.42534openalex-snapshot
Error detecting multiple block (d,k) codes
inferredcites →https://doi.org/10.1109/20.92346openalex-snapshot
Overwrite in thin media measured by the method of pseudorandom sequences
inferredcites →https://doi.org/10.1109/26.54971openalex-snapshot
On the capacity of binary and Gaussian channels with run-length-limited inputs
inferredcites →https://doi.org/10.1109/glocom.1990.116788openalex-snapshot
Bounds on the capacity of the peak shift magnetic recording channel
inferredcites →https://doi.org/10.1109/icc.1989.49948openalex-snapshot
Magnetic and optical storage systems: opportunities for communications technology
inferredcites →https://doi.org/10.1109/tit.1973.1055108openalex-snapshot
A theorem on the entropy of certain binary sequences and applications--II
inferredcites →https://doi.org/10.1109/tmag.1979.1070322openalex-snapshot
Effect of bitshift distribution on error rate in magnetic recording
inferredcites →https://doi.org/10.1109/tmag.1982.1062095openalex-snapshot
Applications of a peak detection channel model
inferredcites →https://doi.org/10.1109/tmag.1985.1063972openalex-snapshot
Recording codes for digital magnetic storage
inferredcites →https://doi.org/10.1109/tmag.1986.1064566openalex-snapshot
The effects of nonlinear distortion on class IV partial response
inferredcites →https://doi.org/10.1109/tmag.1987.1065193openalex-snapshot
Combined error correction/Modulation codes
inferredcites →https://doi.org/10.1147/rd.282.0206openalex-snapshot
Analysis of Correctable Errors in the IBM 3380 Disk File
inferredcites →https://doi.org/10.1201/9780203490310.ch17openalex-snapshot
Runlength Limited Sequences
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.1007/978-3-319-66278-7_9openalex-snapshot
Reliable Communication Across Parallel Asynchronous Channels with Glitches
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.335946openalex-snapshot
Bounds on the zero-error capacity of the input-constrained bit-shift channel
inferred← citeshttps://doi.org/10.1109/18.651018openalex-snapshot
The capacity of binary channels that use linear codes and decoders
inferred← citeshttps://doi.org/10.1109/18.669291openalex-snapshot
The capacity of orthogonal and bi-orthogonal codes on the Gaussian channel
inferred← citeshttps://doi.org/10.1109/glocom.2009.5426080openalex-snapshot
Coding for a Bit-Shift Channel with Applications to Inductively Coupled Channels
inferred← citeshttps://doi.org/10.1109/glocom.2017.8254226openalex-snapshot
Communication with Crystal-Free Radios
inferred← citeshttps://doi.org/10.1109/icc.2010.5502263openalex-snapshot
Design of a Concatenated Coding Scheme for a Bit-Shift Channel
inferred← citeshttps://doi.org/10.1109/isit.1993.748553openalex-snapshot
On Trellis Codes for Peak Shift Magnetic Recording Channel
inferred← citeshttps://doi.org/10.1109/isit.1993.748559openalex-snapshot
Correcting Single Peak-shifts with Perfect (d,k)-codes
inferred← citeshttps://doi.org/10.1109/isit.2000.866731openalex-snapshot
The binary jitter channel: a new model for magnetic recording
inferred← citeshttps://doi.org/10.1109/isit.2011.6033981openalex-snapshot
Bounds and constructions for granular media coding
inferred← citeshttps://doi.org/10.1109/isit.2015.7282793openalex-snapshot
Coding for the ℓ∞-limited permutation channel
inferred← citeshttps://doi.org/10.1109/isit.2016.7541814openalex-snapshot
String concatenation construction for Chebyshev permutation channel codes
inferred← citeshttps://doi.org/10.1109/isit.2017.8006866openalex-snapshot
Coding for the permutation channel with insertions, deletions, substitutions, and erasures
inferred← citeshttps://doi.org/10.1109/isit.2019.8849247openalex-snapshot
Bounds on Codes for the Bit-Shift Channel with (d,k)-Constrained Inputs
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174161openalex-snapshot
The Capacity of Multidimensional Permutations with Restricted Movement
inferred← citeshttps://doi.org/10.1109/isit63088.2025.11195449openalex-snapshot
Message Identification Over Binary Noisy Permutation Channels
inferred← citeshttps://doi.org/10.1109/ita.2011.5743625openalex-snapshot
Constrained codes for passive RFID communication
inferred← citeshttps://doi.org/10.1109/itw.2015.7133092openalex-snapshot
Zero-latency zero-error codes for parallel asynchronous channels with arbitrary skews
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611467openalex-snapshot
Asymptotics of Constant-Weight Constrained Sequences with Applications
inferred← citeshttps://doi.org/10.1109/itw54588.2022.9965829openalex-snapshot
Optimal Error-Detecting Codes for General Asymmetric Channels via Sperner Theory
inferred← citeshttps://doi.org/10.1109/tcomm.2014.032314.130723openalex-snapshot
Near-Field Passive RFID Communication: Channel Model and Code Design
inferred← citeshttps://doi.org/10.1109/tcomm.2018.2840713openalex-snapshot
Communication with Crystal-Free Radios
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.2011.2145490openalex-snapshot
Constant-Weight and Constant-Charge Binary Run-Length Limited Codes
inferred← citeshttps://doi.org/10.1109/tit.2012.2201370openalex-snapshot
Coding for Inductively Coupled Channels
inferred← citeshttps://doi.org/10.1109/tit.2014.2301811openalex-snapshot
Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.1109/tit.2014.2352613openalex-snapshot
Zero-Error Capacity of a Class of Timing Channels
inferred← citeshttps://doi.org/10.1109/tit.2015.2445758openalex-snapshot
New Bounds and Constructions for Granular Media Coding
inferred← citeshttps://doi.org/10.1109/tit.2015.2504358openalex-snapshot
On the Capacity of Channels With Timing Synchronization Errors
inferred← citeshttps://doi.org/10.1109/tit.2016.2636216openalex-snapshot
Reliable Communications Across Parallel Asynchronous Channels With Arbitrary Skews
inferred← citeshttps://doi.org/10.1109/tit.2017.2756667openalex-snapshot
Zero-Error Capacity of $ P $ -ary Shift Channels and FIFO Queues
inferred← citeshttps://doi.org/10.1109/tit.2017.2762676openalex-snapshot
Coding for the $\boldsymbol \ell _\infty $ -Limited Permutation Channel
inferred← citeshttps://doi.org/10.1109/tit.2019.2907979openalex-snapshot
Runlength-Limited Sequences and Shift-Correcting Codes: Asymptotic Analysis
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.2024.3483303openalex-snapshot
Gilbert–Varshamov Bound for Codes in L₁ Metric Using Multivariate Analytic Combinatorics
inferred← citeshttps://doi.org/10.48550/arxiv.1805.08284openalex-snapshot
Communication with Crystal-Free Radios
inferred← citeshttps://doi.org/10.48550/arxiv.1911.02233openalex-snapshot
Master's thesis: Permutations With Restricted Movement
inferred← citeshttps://doi.org/10.48550/arxiv.math-ph/0410052openalex-snapshot
On the Variational Principle for Generalized Gibbs Measures
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.