Linear and non-linear run length limited codes
Files
(Published version)
Date
2015
Authors
Lechner, G.
Land, I.
Grant, A.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Journal article
Citation
IEEE Communications Letters, 2015; 19(7, article no. 7091903):1085-1088
Statement of Responsibility
Conference Name
Abstract
We compare achievable rates of binary linear and non-linear run length limited codes where the constraint is on the number of consecutive ones. We show that there is a significant loss in rate when linear codes are used. For non-linear codes, we present practical encoders with rates close to the theoretical limits. We show that our approach can be generalised to avoid arbitrary sequences in the data stream.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2015 IEEE
Access Condition Notes: Postprint only available on Open Access