A bisemilattice valued fuzzy set generates two collections of level sets, corresponding to each of two orders existing in a bisemilattice. Set union of these two collections is considered to be a binary block-code. Starting with a finite bisemilattice, we present an algorithm for the construction of a bisemilattice valued fuzzy set which has the following properties: it has maximal number of levels (i.e., maximal cardinality of the corresponding block-code) and minimal domain.