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

DOI10.1134/S0032946010040095zbMATH Open1233.94010MaRDI QIDQ764093FDOQ764093

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

Publication date: 13 March 2012

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

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

zbMATH Keywords

algorithm for enumeration and denumeration of wordsconstraints on run lengths

Mathematics Subject Classification ID

Source coding (94A29)

Cites Work

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

Cited In (2)

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

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)