A general error-correcting code construction for run-length limited binary channels
From MaRDI portal
Publication:3472055
DOI10.1109/18.45295zbMATH Open0695.94018OpenAlexW2092534508MaRDI QIDQ3472055FDOQ3472055
Authors:
Publication date: 1989
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.45295
Recommendations
Channel models (including quantum) in information and communication theory (94A40) Theory of error-correcting codes and error-detecting codes (94B99)
Cited In (19)
- On ternary error correcting line codes
- Error-correcting codes with bounded running digital sum
- A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
- A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
- Generalized concatenated codes for channels where unidirectional byte errors are predominant
- Focused codes for channels with skewed errors
- Approximate algorithms of construction of largest error-correcting codes which correct one error on the \(Z\)-channel
- Almost-Certainly Runlength-Limiting Codes
- Binary codes for compound channels (Corresp.)
- A note on the method of poles for code construction
- Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
- Enumeration of constant-weight run-length limited binary sequences
- Runlength-limited codes for single error detection in the magnetic recording channel
- On runlength codes
- Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructions for variable-length error-correcting codes
- Bounds on the zero-error capacity of the input-constrained bit-shift channel
This page was built for publication: A general error-correcting code construction for run-length limited binary channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3472055)
