Perfect codes in poset block spaces
There is a limited class of perfect codes with respect to the classical Hamming metric. There are other kind of metrics with respect to which perfect codes have been investigated viz. poset metric, block metric and poset block metric. Given the minimal elements of a poset, a necessary and sufficient condition for [Formula: see text]-perfectness of a poset block code has been derived. A necessary and sufficient condition for a poset block code to be [Formula: see text]-perfect has also been considered. Further, for each [Formula: see text], [Formula: see text], a sufficient condition that ensures the existence of a poset block structure which turns a given code into an [Formula: see text]-perfect poset block code has been obtained. Several illustrations of well known codes to be [Formula: see text]-perfect for specific values of [Formula: see text] have been explored.