Full Non-Binary Constant-Weight Codes

This paper presents the research results of mixed base number systems using binomial representation of numbers. It also shows the investigated non-linear coding techniques with full constant-weight codes, which are based on the binomial numeration. These codes can be used in a variety of computer applications: in code-based cryptosystems; to detect errors in asymmetric communication channels, etc. We propose a new numeral system. It combines the features of positional and binomial numeration. We suggest a technique of full non-binary constant-weight coding based on a generalized binomial-positional representation. It allows us to generalize the known approach to the non-binary case and practically implement computational algorithms for generating full set of non-binary constant-weight sequences. There are the analytical relations that relate the positional and binomial representations of numbers. The article provides several examples, which clear up the usefulness and the constructiveness of the proposed approach, and simplify the perception and understanding of results. We also consider some aspects of the potential use of the proposed numeral system. In particular, the article discusses asymmetric communication channels (the model of a binary Z-channel and its generalization to the non-binary model), and shows the advantage of constant-weight codes for error detection.