Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes

DOI10.1007/s10623-007-9161-7zbMath1178.94172OpenAlexW2147061030MaRDI QIDQ1009036

Hendrik C. Ferreira, Theo G. Swart, Khmaies Ouahada, Ling Cheng

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-007-9161-7

Mathematics Subject Classification ID

Other types of codes (94B60) Communication theory (94A05) Subgroups of symmetric groups (20B35) Coding theorems (Shannon theory) (94A24) Synchronization error-correcting codes (94B50)

Uses Software

• OEIS

Cites Work

• Upper bounds for constant-weight codes
• Coding with permutations
• On the Relation between Linear Difference and Differential Equations with Polynomial Coefficients
• Insertion/deletion correction with spectral nulls
• Constructions of permutation arrays
• Distance-preserving mappings from binary vectors to permutations
• Unnamed Item
• Unnamed Item

This page was built for publication: Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes