Repeat-Free Codes

Thumbnail Image
Download
Name

1909.05694.pdf

Description
Accepted version
Size

287.42 KB

Format

Adobe PDF

Checksum (MD5)

6cd699940080d379bac47d7ce467864d

sword-2021-03-09T17:04:26.original.xml (130 B)
Original SWORD entry document
Date Issued
July 2019
Journal
IEEE International Symposium on Information Theory - Proceedings
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
2019. "Repeat-Free Codes." IEEE International Symposium on Information Theory - Proceedings, 2019-July.
Version
Author's final manuscript
Abstract
© 2019 IEEE. In this paper we consider the problem of encoding data into repeat-free sequences in which sequences are imposed to contain any k-tuple at most once (for predefined k). First, the capacity and redundancy of the repeat-free constraint are calculated. Then, an efficient algorithm, which uses a single bit of redundancy, is presented to encode length-n sequences for k = 2 + 2 log n. This algorithm is then improved to support any value of k of the form k = a log n, for 1 a ≤ 2, while its redundancy is o(n). Lastly, we also calculate the capacity of this constraint when combined with local constraints which are given by a constrained system.
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
10.1109/ISIT.2019.8849483
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.