dc.contributor.authorImmink, Kees A. Schouhamer.
dc.date.accessioned2013-07-15T03:30:06Z
dc.date.available2013-07-15T03:30:06Z
dc.date.copyright2012en_US
dc.date.issued2012
dc.identifier.citationImmink, K. A. S. (2012). High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement. IEEE Transactions on Information Theory, 58(10), 6572-6580.en_US
dc.identifier.issn0018-9448en_US
dc.identifier.urihttp://hdl.handle.net/10220/11382
dc.description.abstractIn 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.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesIEEE transactions on information theoryen_US
dc.rights© 2012 IEEE.en_US
dc.titleHigh-rate maximum runlength constrained coding schemes using nibble replacementen_US
dc.typeJournal Article
dc.contributor.schoolSchool of Physical and Mathematical Sciencesen_US
dc.identifier.doihttp://dx.doi.org/10.1109/TIT.2012.2204034


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record