Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
- 4 January 2008
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 48 (2) , 141-154
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the distance optimality of permutation mappings2005
- Distance-preserving mappings from binary vectors to permutationsIEEE Transactions on Information Theory, 2003
- Interference cancellation with permutation trellis codes2002
- Constructions of permutation arraysIEEE Transactions on Information Theory, 2002
- On single-deletion-correcting codes2002
- Upper bounds for constant-weight codesIEEE Transactions on Information Theory, 2000
- Insertion/deletion correction with spectral nullsIEEE Transactions on Information Theory, 1997
- Coding with permutationsInformation and Control, 1979
- Redundant Alphabets with Desirable Frequency Spectrum PropertiesIBM Journal of Research and Development, 1968