On the public citation graph

Coding for higher-order partial-response channels

0 signed · 53 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 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-4615-4565-1_5openalex-snapshot
Interleaved Parity Check Codes and Reduced Complexity Detection
inferred← citeshttps://doi.org/10.1109/18.720539openalex-snapshot
Codes for digital recorders
inferred← citeshttps://doi.org/10.1109/18.746796openalex-snapshot
Error-event characterization on partial-response channels
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.887880openalex-snapshot
Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping
inferred← citeshttps://doi.org/10.1109/18.904557openalex-snapshot
On codes that avoid specified differences
inferred← citeshttps://doi.org/10.1109/20.539241openalex-snapshot
Maximum transition run codes for data storage systems
inferred← citeshttps://doi.org/10.1109/20.539242openalex-snapshot
Trellis codes for (1,k) E/sup 2/PR4ML with squared distance 18
inferred← citeshttps://doi.org/10.1109/20.617713openalex-snapshot
Distance enhancing codes for E/sup 2/PRML: performance comparison using spinstand data
inferred← citeshttps://doi.org/10.1109/20.617717openalex-snapshot
An 8/9 rate time-varying trellis code for high density magnetic recording
inferred← citeshttps://doi.org/10.1109/20.617718openalex-snapshot
Design of a rate 6/7 maximum transition run code
inferred← citeshttps://doi.org/10.1109/20.663448openalex-snapshot
Distance-enhancing codes for digital recording
inferred← citeshttps://doi.org/10.1109/20.663455openalex-snapshot
The performance of generalized maximum transition run trellis codes
inferred← citeshttps://doi.org/10.1109/20.663463openalex-snapshot
Low complexity signal space detection for MTR coded channels
inferred← citeshttps://doi.org/10.1109/20.703887openalex-snapshot
A new target response with parity coding for high density magnetic recording channels
inferred← citeshttps://doi.org/10.1109/20.825835openalex-snapshot
Combatting partial erasure and transition jitter in magnetic recording
inferred← citeshttps://doi.org/10.1109/20.917613openalex-snapshot
Application of distance enhancing codes
inferred← citeshttps://doi.org/10.1109/20.920493openalex-snapshot
Rate 8/9 sliding block distance-enhancing code with stationary detector
inferred← citeshttps://doi.org/10.1109/26.701316openalex-snapshot
Sequence detection for binary ISI channels using signal-space partitioning
inferred← citeshttps://doi.org/10.1109/26.737388openalex-snapshot
On Viterbi detector path metric differences
inferred← citeshttps://doi.org/10.1109/4.962303openalex-snapshot
A 300-MHz fixed-delay tree search-DFE analog CMOS disk-drive read channel
inferred← citeshttps://doi.org/10.1109/49.920173openalex-snapshot
Reduced complexity sequence detection for high-order partial response channels
inferred← citeshttps://doi.org/10.1109/79.689599openalex-snapshot
The role of SP in data-storage systems
inferred← citeshttps://doi.org/10.1109/ahici.2009.5340268openalex-snapshot
Codes for magnetic recorders
inferred← citeshttps://doi.org/10.1109/allerton.2019.8919932openalex-snapshot
Asymmetric LOCO Codes: Constrained Codes for Flash Memories
inferred← citeshttps://doi.org/10.1109/cicc.1999.777297openalex-snapshot
Hard disk drive read channels: technology and trends
inferred← citeshttps://doi.org/10.1109/glocom.1996.594388openalex-snapshot
An interleaved coding scheme for (1-D)(1+D)/sup 2/ partial response with concatenated decoding
inferred← citeshttps://doi.org/10.1109/glocom.1996.594391openalex-snapshot
Analysis of error sequences for PRML and EPRML signaling performed over Lorentzian channel
inferred← citeshttps://doi.org/10.1109/glocom.1996.594392openalex-snapshot
Improved estimates of Viterbi detector path metric differences
inferred← citeshttps://doi.org/10.1109/glocom.1997.644335openalex-snapshot
Time-varying MTR codes for high density magnetic recording
inferred← citeshttps://doi.org/10.1109/glocom.1998.776474openalex-snapshot
Concatenated error correction coding for high-order PRML channels
inferred← citeshttps://doi.org/10.1109/glocom.1998.776484openalex-snapshot
Distance enhancing constraints for noise predictive maximum likelihood detectors
inferred← citeshttps://doi.org/10.1109/glocom.1999.830204openalex-snapshot
Bounds on the rate of codes which forbid specified difference sequences
inferred← citeshttps://doi.org/10.1109/glocom.2001.965979openalex-snapshot
List Viterbi decoding with continuous error detection for magnetic recording
inferred← citeshttps://doi.org/10.1109/icc.1998.685096openalex-snapshot
An analog EPR4 read channel with an FDTS detector
inferred← citeshttps://doi.org/10.1109/icc.1999.765512openalex-snapshot
A rate 16/17 punctured MTR block code
inferred← citeshttps://doi.org/10.1109/icc.1999.765514openalex-snapshot
Interleaved parity check codes and reduced complexity detection
inferred← citeshttps://doi.org/10.1109/icc.1999.765515openalex-snapshot
A rate 8/9 sliding block trellis code with stationary detector for magnetic recording
inferred← citeshttps://doi.org/10.1109/intmag.1997.597529openalex-snapshot
Distance Enhancing Codes For E2PRML: Performance Comparison Using Spinstand Data
inferred← citeshttps://doi.org/10.1109/intmag.1997.597533openalex-snapshot
An 8/9 Rate Time-varying Trellis Code For High Density Magnetic Recording
inferred← citeshttps://doi.org/10.1109/isit.1998.708661openalex-snapshot
Error event characterization and coding for the equalized Lorentzian channel
inferred← citeshttps://doi.org/10.1109/isit.2015.7282753openalex-snapshot
Coding schemes for inter-cell interference in flash memory
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174176openalex-snapshot
Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution
inferred← citeshttps://doi.org/10.1109/itw44776.2019.8989270openalex-snapshot
A New Family of Constrained Codes with Applications in Data Storage
inferred← citeshttps://doi.org/10.1109/jlt.2009.2012728openalex-snapshot
Maximum-Likelihood Detection and Constrained Coding on Optical Channels
inferred← citeshttps://doi.org/10.1109/tcomm.2021.3073179openalex-snapshot
Power Spectra of Constrained Codes With Level-Based Signaling: Overcoming Finite-Length Challenges
inferred← citeshttps://doi.org/10.1109/tit.2009.2013019openalex-snapshot
Error-Pattern-Correcting Cyclic Codes Tailored to a Prescribed Set of Error Cluster Patterns
inferred← citeshttps://doi.org/10.1109/tit.2011.2143910openalex-snapshot
Periodic-Finite-Type Shift Spaces
inferred← citeshttps://doi.org/10.1109/tit.2022.3170692openalex-snapshot
The Secret Arithmetic of Patterns: A General Method for Designing Constrained Codes Based on Lexicographic Indexing
inferred← citeshttps://doi.org/10.1109/tit.2024.3375979openalex-snapshot
Eliminating Media Noise While Preserving Storage Capacity: Reconfigurable Constrained Codes for Two-Dimensional Magnetic Recording
inferred← citeshttps://doi.org/10.1109/tmag.2002.804798openalex-snapshot
Mostly analog disk drive read channel with practical depth-of-two fixed delay tree search
inferred← citeshttps://doi.org/10.1109/tmbmc.2024.3400794openalex-snapshot
Protecting the Future of Information: LOCO Coding With Error Detection for DNA Data Storage
inferred← citeshttps://doi.org/10.1201/9781420041545-36openalex-snapshot
A Read Channel for Magnetic Recording
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.