On the Unequal Error Protection Capability of a q-Ary Image of a Low-Rate qm-Ary Cyclic Code

Katsumi SAKAKIBARA; Masao KASAHARA; Yoshiharu YUBA

On the Unequal Error Protection Capability of a q-Ary Image of a Low-Rate q^m-Ary Cyclic Code

Katsumi SAKAKIBARA, Masao KASAHARA, Yoshiharu YUBA

Full Text Views

0

Cite this

Summary :

An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate q^m-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF (q^m) into GF (q). A table of the UEP capability of binary images of low-rate Reed-Solomon codes over GF (2⁶) is given. It is shown that the encoding and decoding algorithms for superimposed concatenated codes can be applied to a q-ary image as a linear UEP code.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.9 pp.1305-1312

Publication Date: 1996/09/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)

Category: Coding Theory

Cite this

Copy

Katsumi SAKAKIBARA, Masao KASAHARA, Yoshiharu YUBA, "On the Unequal Error Protection Capability of a q-Ary Image of a Low-Rate qm-Ary Cyclic Code" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 9, pp. 1305-1312, September 1996, doi: .
Abstract: An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate q^m-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF (q^m) into GF (q). A table of the UEP capability of binary images of low-rate Reed-Solomon codes over GF (2⁶) is given. It is shown that the encoding and decoding algorithms for superimposed concatenated codes can be applied to a q-ary image as a linear UEP code.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_9_1305/_p

Copy

@ARTICLE{e79-a_9_1305,
author={Katsumi SAKAKIBARA, Masao KASAHARA, Yoshiharu YUBA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On the Unequal Error Protection Capability of a q-Ary Image of a Low-Rate qm-Ary Cyclic Code},
year={1996},
volume={E79-A},
number={9},
pages={1305-1312},
abstract={An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate q^m-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF (q^m) into GF (q). A table of the UEP capability of binary images of low-rate Reed-Solomon codes over GF (2⁶) is given. It is shown that the encoding and decoding algorithms for superimposed concatenated codes can be applied to a q-ary image as a linear UEP code.},
keywords={},
doi={},
ISSN={},
month={September},}

Copy

TY - JOUR
TI - On the Unequal Error Protection Capability of a q-Ary Image of a Low-Rate qm-Ary Cyclic Code
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1305
EP - 1312
AU - Katsumi SAKAKIBARA
AU - Masao KASAHARA
AU - Yoshiharu YUBA
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 1996
AB - An algorithm for finding the unequal error protection (UEP) capability of a q-ary image of a low-rate q^m-ary cyclic code is presented by combining its concatenated structure with the UEP capability of concatenated codes. The results are independent of a choice of a basis to be used for expanding an element over GF (q^m) into GF (q). A table of the UEP capability of binary images of low-rate Reed-Solomon codes over GF (2⁶) is given. It is shown that the encoding and decoding algorithms for superimposed concatenated codes can be applied to a q-ary image as a linear UEP code.
ER -