Back to Search
Start Over
Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes.
- Source :
- Designs, Codes & Cryptography; Aug2008, Vol. 48 Issue 2, p141-154, 14p
- Publication Year :
- 2008
-
Abstract
- 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- PERMUTATIONS
COMBINATORICS
MATHEMATICS
PERMANENTS (Matrices)
Subjects
Details
- Language :
- English
- ISSN :
- 09251022
- Volume :
- 48
- Issue :
- 2
- Database :
- Complementary Index
- Journal :
- Designs, Codes & Cryptography
- Publication Type :
- Academic Journal
- Accession number :
- 33025476
- Full Text :
- https://doi.org/10.1007/s10623-007-9161-7