Abstract
We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being subsets of run-length limited codes, Nyquist null codes and constant weight codes.
Original language | English |
---|---|
Pages (from-to) | 141-154 |
Number of pages | 14 |
Journal | Designs, Codes, and Cryptography |
Volume | 48 |
Issue number | 2 |
DOIs | |
Publication status | Published - Aug 2008 |
Keywords
- Constant weight codes
- Insertion/deletion correcting codes
- Permutation codes
- Run-length limited codes
- Spectral null codes
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science Applications
- Discrete Mathematics and Combinatorics
- Applied Mathematics