Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:764093
Jump to:navigation, search

DOI10.1134/S0032946010040095zbMath1233.94010MaRDI QIDQ764093

Yu. S. Medvedeva, Boris 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)


Related Items (1)

Fast enumeration of words generated by Dyck grammars




Cites Work

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




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:764093&oldid=12701194"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 10:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki