Welfare interface implementation using multiple facial features tracking for the disabled people
Pattern Recognition Letters
Distance-increasing mappings from binary vectors to constant composition vectors
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Constructing Constant Composition Codes via Distance-Increasing Mappings
SIAM Journal on Discrete Mathematics
| Hi-index | 754.84 |
In this correspondence, for any k ges 2, we first propose two constructions of (n,k) distance-increasing mappings (DIMs) from the set of binary vectors of length n to the set of permutations of the same length that strictly increase the Hamming distance by at least k except when it is obviously not possible. Next, we prove that for any k ges 2, there is a smallest positive integer nk such that an (n,k) DIM can be constructed for any n ges nk. An explicit upper bound on nk is also given