Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
