| dc.contributor.author | Elishco, Ohad | |
| dc.contributor.author | Gabrys, Ryan | |
| dc.contributor.author | Yaakobi, Eitan | |
| dc.contributor.author | Medard, Muriel | |
| dc.date.accessioned | 2021-11-08T16:46:03Z | |
| dc.date.available | 2021-11-08T15:54:53Z | |
| dc.date.available | 2021-11-08T16:46:03Z | |
| dc.date.issued | 2019-07 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/137690.2 | |
| dc.description.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. | en_US |
| dc.language.iso | en | |
| dc.publisher | Institute of Electrical and Electronics Engineers (IEEE) | en_US |
| dc.relation.isversionof | 10.1109/ISIT.2019.8849483 | en_US |
| dc.rights | Creative Commons Attribution-Noncommercial-Share Alike | en_US |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-sa/4.0/ | en_US |
| dc.source | arXiv | en_US |
| dc.title | Repeat-Free Codes | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | 2019. "Repeat-Free Codes." IEEE International Symposium on Information Theory - Proceedings, 2019-July. | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Research Laboratory of Electronics | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.relation.journal | IEEE International Symposium on Information Theory - Proceedings | en_US |
| dc.eprint.version | Author's final manuscript | en_US |
| dc.type.uri | http://purl.org/eprint/type/ConferencePaper | en_US |
| eprint.status | http://purl.org/eprint/status/NonPeerReviewed | en_US |
| dc.date.updated | 2021-03-09T17:04:26Z | |
| dspace.orderedauthors | Elishco, O; Gabrys, R; Medard, M; Yaakobi, E | en_US |
| dspace.date.submission | 2021-03-09T17:04:27Z | |
| mit.journal.volume | 2019-July | en_US |
| mit.license | OPEN_ACCESS_POLICY | |
| mit.metadata.status | Publication Information Needed | en_US |
