scientific article; zbMATH DE number 1396785
Many combinatorial objects can be represented as \(q\)-ary vectors, \(q\geq 2\). A set of such vectors is called a lexicographic code (a lexicode) if the codewords are ordered lexicographically. A set of ordered vectors is called a Gray code if the change when passing to the next vector is minimal. A short survey of various numerations suitable for the above-mentioned codes is presented. For example, a binary numeration is appropriate for the enumeration of binary lexicodes and binary Gray codes. A binomial numeration is proper for such codes when they have constant weight. Let \(C(n,k)\) be a code of all partitions of a given number \(n\) into \(k\) parts, \(k>0\). A cyclonomial numeration, which is a generalization of a binomial system, is suitable for \(q\)-ary lexicodes of constant weight. The problem of finding a codeword from its number in a code is considered.
- Binomial coefficients, valuations, and words
- Cyclonomial number systems and the ranking of lexicographically ordered constant-sum codes
- Binomial coefficients and enumeration of restricted words
- scientific article; zbMATH DE number 3946132 (Why is no real title available?)
- On the Combinatorics of Placing Balls into Ordered Bins
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 Q4936735)
