Fast enumeration algorithm for words with given constraints on run lengths of ones

DOI10.1134/S0032946010040095MaRDI QIDQ764093zbMATH OpenFDO

Authors Yu. S. Medvedeva, B. Ya. Ryabko

Publication date 13 March 2012

Published in Problems of Information Transmission (Search for Journal in Brave)

zbMATH Keywords

algorithm for enumeration and denumeration of wordsconstraints on run lengths

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

• Fast enumeration of words generated by Dyck grammars
• A recurrence algorithm of enumeration on only one forbidden word
• scientific article; zbMATH DE number 1979670
• Efficient enumeration of words in regular languages
• scientific article; zbMATH DE number 2010073

Cites work

• A generalized method for encoding and decoding run-length-limited binary sequences (Corresp.)
• An enumerative method for runlength-limited codes: permutation codes
• Block codes for a class of constrained noiseless channels
• Enumerative coding for constant-weight binary sequences with constrained run-length of zeros
• Fast enumeration of combinatorial objects
• Fibonacci codes for synchronization control

Cited in

(3)

• Efficient generation of binary words of given weight
• Algorithms to enumerate codewords for DC/sup 2/-constrained channels
• Fast enumeration of words generated by Dyck grammars

This page was built for publication: Fast enumeration algorithm for words with given constraints on run lengths of ones

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