On Multiple-Valued Separable Unordered Codes

Yasunori NAGATA; Masao MUKAIDONO

On Multiple-Valued Separable Unordered Codes

Yasunori NAGATA, Masao MUKAIDONO

Full Text Views

0

Cite this

Summary :

In this paper, a new encoding/decoding scheme of multiple-valued separable balanced codes is presented. These codes have 2・m information digits and m・ (R - 2) check digits in radices R 4, 2・m - 1 information digits and m + 1 check digits in R = 3, where code-length n = R・m. In actual use of code-lengths and radices, it is shown that the presented codes are relatively efficient in comparison with multiple-valued Berger codes which are known as optimal unordered codes. Meanwhile, the optimality of multiple-valued Berger codes is discussed.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.2 pp.99-106

Publication Date: 1996/02/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Algorithm and Computational Complexity

Cite this

Copy

Yasunori NAGATA, Masao MUKAIDONO, "On Multiple-Valued Separable Unordered Codes" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 2, pp. 99-106, February 1996, doi: .
Abstract: In this paper, a new encoding/decoding scheme of multiple-valued separable balanced codes is presented. These codes have 2・m information digits and m・ (R - 2) check digits in radices R 4, 2・m - 1 information digits and m + 1 check digits in R = 3, where code-length n = R・m. In actual use of code-lengths and radices, it is shown that the presented codes are relatively efficient in comparison with multiple-valued Berger codes which are known as optimal unordered codes. Meanwhile, the optimality of multiple-valued Berger codes is discussed.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_2_99/_p

Copy

@ARTICLE{e79-d_2_99,
author={Yasunori NAGATA, Masao MUKAIDONO, },
journal={IEICE TRANSACTIONS on Information},
title={On Multiple-Valued Separable Unordered Codes},
year={1996},
volume={E79-D},
number={2},
pages={99-106},
abstract={In this paper, a new encoding/decoding scheme of multiple-valued separable balanced codes is presented. These codes have 2・m information digits and m・ (R - 2) check digits in radices R 4, 2・m - 1 information digits and m + 1 check digits in R = 3, where code-length n = R・m. In actual use of code-lengths and radices, it is shown that the presented codes are relatively efficient in comparison with multiple-valued Berger codes which are known as optimal unordered codes. Meanwhile, the optimality of multiple-valued Berger codes is discussed.},
keywords={},
doi={},
ISSN={},
month={February},}

Copy

TY - JOUR
TI - On Multiple-Valued Separable Unordered Codes
T2 - IEICE TRANSACTIONS on Information
SP - 99
EP - 106
AU - Yasunori NAGATA
AU - Masao MUKAIDONO
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 1996
AB - In this paper, a new encoding/decoding scheme of multiple-valued separable balanced codes is presented. These codes have 2・m information digits and m・ (R - 2) check digits in radices R 4, 2・m - 1 information digits and m + 1 check digits in R = 3, where code-length n = R・m. In actual use of code-lengths and radices, it is shown that the presented codes are relatively efficient in comparison with multiple-valued Berger codes which are known as optimal unordered codes. Meanwhile, the optimality of multiple-valued Berger codes is discussed.
ER -