A combinatorial problem in the class of binary vectors of given weight

DOI10.1007/S10559-012-9466-ZMaRDI QIDQ2263233zbMATH OpenOpenAlexFDO

Authors A. A. Levitskaya

Publication date 18 March 2015

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-012-9466-z

zbMATH Keywords

\(l\)-stepbinary vector of weight \((n-m_0)\)number of \(l\)-steps.

Mathematics Subject Classification ID

Permutations, words, matrices (05A05)

Recommendations

• scientific article; zbMATH DE number 1519421
• On the number of ordered pairs of l-balanced vectors of length n
• Note on large subsets of binary vectors with similar distances
• scientific article; zbMATH DE number 1057273
• Rotation-equivalence classes of binary vectors

Cited in

(6)

• The image of weighted combinatorial problems
• A binary vector of length \(n\) which is \(l\)-balanced with the greatest number of binary vectors
• Influence of Boris V. Gnedenko's probabilistic-statistical school on the development of cybernetics and informatics
• Counting the decimation classes of binary vectors with relatively prime length and density
• Rotation-equivalence classes of binary vectors
• On the number of ordered pairs of l-balanced vectors of length n

This page was built for publication: A combinatorial problem in the class of binary vectors of given weight

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