An enumerative method for runlength-limited codes: permutation codes
From MaRDI portal
Recommendations
Cited in
(10)- Binary permutation sequences as subsets of Levenshtein codes, spectral null codes, run-length limited codes and constant weight codes
- Permutation (d,k) codes: efficient enumerative coding and phrase length distribution shaping
- A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
- Generation, Ranking and Unranking of Permutations based on the Mixed-Radix Codes
- Error propagation assessment of enumerative coding schemes
- Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD
- scientific article; zbMATH DE number 2154138 (Why is no real title available?)
- On the principal state method for run-length limited sequences
- Fast enumeration algorithm for words with given constraints on run lengths of ones
- Enumeration of constant-weight run-length limited binary sequences
This page was built for publication: An enumerative method for runlength-limited codes: permutation codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503395)