Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/25603
Title: | L-fuzzy sets and codes | Authors: | Šešelja Branimir Tepavčević Andreja Vojvodić Gradimir |
Issue Date: | 1993 | Journal: | Fuzzy Sets and Systems | Abstract: | A decomposition of an L-valued finite fuzzy set (L is a lattice) gives a family of characteristic functions, which can be considered as a binary block-code. Using a previous theorem of synthesis for fuzzy sets, we give conditions under which an arbitrary block-code corresponds to an L-valued fuzzy set. An explicit description of the Hamming distance, as well as of any code distance is also given, all in lattice-theoretic terms. Finally, we give necessary and sufficient conditions under which a linear code corresponds to an L-valued fuzzy set. It turns out that in such case the lattice L has to be Boolean. © 1993. | URI: | https://open.uns.ac.rs/handle/123456789/25603 | ISSN: | 0165-0114 | DOI: | 10.1016/0165-0114(93)90175-H |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
SCOPUSTM
Citations
10
checked on Nov 20, 2023
Page view(s)
17
Last Week
7
7
Last month
0
0
checked on May 10, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.