Almost-Certainly Runlength-Limiting Codes
From MaRDI portal
Publication:4550263
DOI10.1007/3-540-45325-3_13zbMATH Open0998.94525OpenAlexW1819921656MaRDI QIDQ4550263FDOQ4550263
Publication date: 25 November 2002
Published in: Cryptography and Coding (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45325-3_13
Recommendations
Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40) Combined modulation schemes (including trellis codes) in coding theory (94B12)
Cited In (12)
- Sequences and codes with asymmetrical runlength constraints
- On runlength-limited coding with DC control
- Some new runlength-limited convolutional codes
- A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
- A general error-correcting code construction for run-length limited binary channels
- On the capacity of M-ary runlength-limited codes
- Title not available (Why is that?)
- Runlength-limited codes for single error detection in the magnetic recording channel
- On the bit oriented trellis structure of run length limited codes on discrete local data dependent channels
- Constructions of almost block-decodable runlength-limited codes
- Title not available (Why is that?)
- A class of high-rate \(N/(N+1)\) low-complexity error-detecting RLL codes
This page was built for publication: Almost-Certainly Runlength-Limiting Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4550263)