scientific article; zbMATH DE number 1979670

MaRDI QIDQ4428041zbMATH OpenFDO

Authors V. A. Amel'kin

Publication date 14 September 2003

zbMATH Keywords

dependent random variableslongest runsserial sequencesource encoding

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Source coding (94A29) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Recommendations

• scientific article; zbMATH DE number 2010073
• scientific article; zbMATH DE number 53746
• Numeration of non-decreasing and non-increasing n-valued serial sequences
• Algorithms for the exact solution of the problems of enumeration, coding, and generation of serial sequences
• The enumeration of certain run length sequences

Cited in

(7)

• Enumerative coding for constant-weight binary sequences with constrained run-length of zeros
• Algorithms for the exact solution of the problems of enumeration, coding, and generation of serial sequences
• scientific article; zbMATH DE number 53746 (Why is no real title available?)
• scientific article; zbMATH DE number 2010073 (Why is no real title available?)
• scientific article; zbMATH DE number 1766781 (Why is no real title available?)
• On finding minimal, maximal, and consistent sequences over a binary alphabet
• Fast enumeration algorithm for words with given constraints on run lengths of ones

This page was built for publication:

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