ON MULTIPLE-VALUED SEPARABLE UNORDERED CODES

In this paper, a new encoding/decoding scheme of multiple-valued separ able balanced codes is presented. These codes have 2 . m information d igits and m .(R - 2) check digits in radices R greater than or equal t o 4, 2 . m - 1 information digits and m + 1 check digits in R = 3, whe re code-length n = R . m. In actual use of code-lengths and radices, i t is shown that the presented codes are relatively efficient in compar ison with multiple-valued Berger codes which are known as optimal unor dered codes. Meanwhile, the optimality of multiple-valued Berger codes is discussed.