Abstract

We obtain long binary sequences by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of the Levenshtein codes, capable of correcting insertion/deletion errors and subsets of the higher order spectral nulls codes, with spectral nulls at certain frequencies

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call