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

DOI10.1007/S10623-007-9161-7MaRDI QIDQ1009036zbMATH OpenOpenAlexFDO

Authors Khmaies Ouahada, Theo G. Swart, Hendrik C. Ferreira, 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

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

Recommendations

• Insertion/deletion correction with spectral nulls
• Burst-deletion-correcting codes for permutations and multipermutations
• An enumerative method for runlength-limited codes: permutation codes
• scientific article; zbMATH DE number 177034
• Constructions of binary constant-weight cyclic codes and cyclically permutable codes

Cites work

• Coding with permutations
• Constructions of permutation arrays
• Distance-preserving mappings from binary vectors to permutations
• scientific article; zbMATH DE number 1867238 (Why is no real title available?)
• Insertion/deletion correction with spectral nulls
• On the Relation between Linear Difference and Differential Equations with Polynomial Coefficients
• The On-Line Encyclopedia of Integer Sequences
• Upper bounds for constant-weight codes

Cited in

(2)

• Perfect codes and balanced generalized weighing matrices. II
• Enumerative coding for constant-weight binary sequences with constrained run-length of zeros

Describes a project that uses

Uses Software

• OEIS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009036)