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...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | English |
| 出版: |
2013
|
| 在線閱讀: | https://hdl.handle.net/10356/96113 http://hdl.handle.net/10220/11382 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| id |
sg-ntu-dr.10356-96113 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.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. |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| country |
Singapore |
| collection |
DR-NTU |
| language |
English |
| 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. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Immink, Kees A. Schouhamer. |
| format |
Article |
| author |
Immink, Kees A. Schouhamer. |
| spellingShingle |
Immink, Kees A. Schouhamer. High-rate maximum runlength constrained coding schemes using nibble replacement |
| author_sort |
Immink, Kees A. Schouhamer. |
| title |
High-rate maximum runlength constrained coding schemes using nibble replacement |
| title_short |
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_sort |
high-rate maximum runlength constrained coding schemes using nibble replacement |
| publishDate |
2013 |
| url |
https://hdl.handle.net/10356/96113 http://hdl.handle.net/10220/11382 |
| _version_ |
1681047649468284928 |