Furthermore, given a constant k, we construct binary codes of length n for correcting a k-substring edit with redundancy of roughly 2logn, compared to 8logn, the lowest redundancy achievable by an ...

Furthermore, given a constant k, we construct binary codes of length n for correcting a k-substring edit with redundancy of roughly 2logn, compared to 8logn, the lowest redundancy achievable by an ...

The problem seems to involve finding if a given string can be constructed by repeatedly appending a substring of itself. My initial thought is to iterate through possible substring lengths and check ...