Repeat-Free Codes
© 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 u...
Main Authors: | Elishco, Ohad, Gabrys, Ryan, Yaakobi, Eitan, Medard, Muriel |
---|---|
Other Authors: | Massachusetts Institute of Technology. Research Laboratory of Electronics |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
Online Access: | https://hdl.handle.net/1721.1/137690.2 |
Similar Items
-
Repeat-Free Codes
by: Elishco, Ohad, et al.
Published: (2022) -
Coding for locality in reconstructing permutations
by: Raviv, Netanel, et al.
Published: (2018) -
Coding for locality in reconstructing permutations
by: Raviv, Netanel, et al.
Published: (2018) -
Throughput and Delay Analysis for Coded ARQ
by: Malak, Derya, et al.
Published: (2021) -
Random Linear Network Coding on Programmable Switches
by: Medard, Muriel
Published: (2021)