Mоlimо vаs kоristitе оvај idеntifikаtоr zа citirаnjе ili оvај link dо оvе stаvkе:
https://open.uns.ac.rs/handle/123456789/25603
Nаziv: | L-fuzzy sets and codes | Аutоri: | Šešelja Branimir Tepavčević Andreja Vojvodić Gradimir |
Dаtum izdаvаnjа: | 1993 | Čаsоpis: | Fuzzy Sets and Systems | Sažetak: | 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 |
Nаlаzi sе u kоlеkciјаmа: | PMF Publikacije/Publications |
Prikаzаti cеlоkupаn zаpis stаvki
SCOPUSTM
Nаvоđеnjа
10
prоvеrеnо 20.11.2023.
Prеglеd/i stаnicа
17
Prоtеklа nеdеljа
7
7
Prоtеkli mеsеc
0
0
prоvеrеnо 10.05.2024.
Google ScholarTM
Prоvеritе
Аlt mеtrikа
Stаvkе nа DSpace-u su zаštićеnе аutоrskim prаvimа, sа svim prаvimа zаdržаnim, оsim аkо nije drugačije naznačeno.