High-rate maximum runlength constrained coding schemes using nibble replacement
In this paper, we will present coding techniques for the character-constrained channel, where information is conveyed using q-bit characters (nibbles), and where w prescribed characters are disallowed. Using codes for the character-constrained channel, we present simple and systematic constructions...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
2013
|
| Online Access: | https://hdl.handle.net/10356/96113 http://hdl.handle.net/10220/11382 |
| _version_ | 1811697732312629248 |
|---|---|
| author | Immink, Kees A. Schouhamer. |
| author2 | School of Physical and Mathematical Sciences |
| author_facet | School of Physical and Mathematical Sciences Immink, Kees A. Schouhamer. |
| author_sort | Immink, Kees A. Schouhamer. |
| collection | NTU |
| description | In this paper, we will present coding techniques for the character-constrained channel, where information is conveyed using q-bit characters (nibbles), and where w prescribed characters are disallowed. Using codes for the character-constrained channel, we present simple and systematic constructions of high-rate binary maximum runlength constrained codes. The new constructions have the virtue that large lookup tables for encoding and decoding are not required. We will compare the error propagation performance of codes based on the new construction with that of prior art codes. |
| first_indexed | 2024-10-01T07:59:56Z |
| format | Journal Article |
| id | ntu-10356/96113 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T07:59:56Z |
| publishDate | 2013 |
| record_format | dspace |
| spelling | ntu-10356/961132020-03-07T12:37:04Z High-rate maximum runlength constrained coding schemes using nibble replacement Immink, Kees A. Schouhamer. School of Physical and Mathematical Sciences In this paper, we will present coding techniques for the character-constrained channel, where information is conveyed using q-bit characters (nibbles), and where w prescribed characters are disallowed. Using codes for the character-constrained channel, we present simple and systematic constructions of high-rate binary maximum runlength constrained codes. The new constructions have the virtue that large lookup tables for encoding and decoding are not required. We will compare the error propagation performance of codes based on the new construction with that of prior art codes. 2013-07-15T03:30:06Z 2019-12-06T19:25:57Z 2013-07-15T03:30:06Z 2019-12-06T19:25:57Z 2012 2012 Journal Article Immink, K. A. S. (2012). High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement. IEEE Transactions on Information Theory, 58(10), 6572-6580. 0018-9448 https://hdl.handle.net/10356/96113 http://hdl.handle.net/10220/11382 10.1109/TIT.2012.2204034 en IEEE transactions on information theory © 2012 IEEE. |
| spellingShingle | Immink, Kees A. Schouhamer. High-rate maximum runlength constrained coding schemes using nibble replacement |
| title | High-rate maximum runlength constrained coding schemes using nibble replacement |
| title_full | High-rate maximum runlength constrained coding schemes using nibble replacement |
| title_fullStr | High-rate maximum runlength constrained coding schemes using nibble replacement |
| title_full_unstemmed | High-rate maximum runlength constrained coding schemes using nibble replacement |
| title_short | High-rate maximum runlength constrained coding schemes using nibble replacement |
| title_sort | high rate maximum runlength constrained coding schemes using nibble replacement |
| url | https://hdl.handle.net/10356/96113 http://hdl.handle.net/10220/11382 |
| work_keys_str_mv | AT imminkkeesaschouhamer highratemaximumrunlengthconstrainedcodingschemesusingnibblereplacement |