Fuzzy codes and distance properties
β Scribed by Pierre A. von Kaenel
- Publisher
- Elsevier Science
- Year
- 1982
- Tongue
- English
- Weight
- 403 KB
- Volume
- 8
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
The starting point of this paper is the introduction of a new measure of inclusion of fuzzy set A in fuzzy set B. Previously used inclusion measures take values in the interval [0; 1]; the inclusion measure proposed here takes values in a Boolean lattice. In other words, an inclusion is viewed as an
## Abstract We study the hamiltonicity of certain graphs obtained from the hypercube as a means of producing a binary code of distance two and length __n__, whose codewords are ordered so that for each two consecutive codewords, one dominates the other. One vector __dominates__ the other, if and on
SAHA, WEHRLI, AND GOMBERG dynamic programming-based algorithm is presented for computing FDT of a fuzzy digital object. It is shown that the algorithm terminates in a finite number of steps and when it does so, it correctly computes FDT. Several potential applications of fuzzy distance transform in