TY - GEN
T1 - Repeat-Free Codes
AU - Elishco, Ohad
AU - Gabrys, Ryan
AU - Medard, Muriel
AU - Yaakobi, Eitan
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7/12
Y1 - 2019/7/12
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85073143803&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2019.8849483
DO - 10.1109/ISIT.2019.8849483
M3 - Conference contribution
AN - SCOPUS:85073143803
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 932
EP - 936
BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers
T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019
Y2 - 7 July 2019 through 12 July 2019
ER -