A general error-correcting code construction for run-length limited binary channels
From MaRDI portal
Publication:3472055
Recommendations
Cited in
(19)- A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
- Constructions of low-degree and error-correcting \(\varepsilon \)-biased generators
- A Finite-Length Algorithm for LDPC Codes Without Repeated Edges on the Binary Erasure Channel
- Constructions for variable-length error-correcting codes
- Enumeration of constant-weight run-length limited binary sequences
- scientific article; zbMATH DE number 3257831 (Why is no real title available?)
- Almost-Certainly Runlength-Limiting Codes
- Binary codes for compound channels (Corresp.)
- Focused codes for channels with skewed errors
- Bounds on the zero-error capacity of the input-constrained bit-shift channel
- Runlength-limited codes for single error detection in the magnetic recording channel
- Error-correcting codes with bounded running digital sum
- On runlength codes
- On ternary error correcting line codes
- Fixed-Rate Maximum-Runlength-Limited Codes From Variable-Rate Bit Stuffing
- scientific article; zbMATH DE number 4207992 (Why is no real title available?)
- A note on the method of poles for code construction
- Approximate algorithms of construction of largest error-correcting codes which correct one error on the \(Z\)-channel
- Generalized concatenated codes for channels where unidirectional byte errors are predominant
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)