A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel

Tadashi WADAYAMA; Koichiro WAKASUGI; Masao KASAHARA

A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel

Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA

Full Text Views

0

Cite this

Summary :

In this paper, we present a method for evaluating the minimum free Chernov distance of trellis-codes for a discrete memoryless channels (DMC). In order to design an efficient trellis-code for the DMC, we need to evaluate the minimum free Chernov distance of the target code. However, the lack of the additive property of the Chernov distance prevents a conventional branch-and-bound search for evaluating the minimum distance. To overcome the difficulty, we present a lower bound on the Chernov distance with an additive property. The lower bound plays a key role in the minimum distance evaluation algorithm presented here. By using the proposed algorithm, we have derived the minimum free Chernov distance of some binary linear convolutional codes over Z-channel.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E81-A No.10 pp.1972-1978

Publication Date: 1998/10/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

Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA, "A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel" in IEICE TRANSACTIONS on Fundamentals, vol. E81-A, no. 10, pp. 1972-1978, October 1998, doi: .
Abstract: In this paper, we present a method for evaluating the minimum free Chernov distance of trellis-codes for a discrete memoryless channels (DMC). In order to design an efficient trellis-code for the DMC, we need to evaluate the minimum free Chernov distance of the target code. However, the lack of the additive property of the Chernov distance prevents a conventional branch-and-bound search for evaluating the minimum distance. To overcome the difficulty, we present a lower bound on the Chernov distance with an additive property. The lower bound plays a key role in the minimum distance evaluation algorithm presented here. By using the proposed algorithm, we have derived the minimum free Chernov distance of some binary linear convolutional codes over Z-channel.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e81-a_10_1972/_p

Copy

@ARTICLE{e81-a_10_1972,
author={Tadashi WADAYAMA, Koichiro WAKASUGI, Masao KASAHARA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel},
year={1998},
volume={E81-A},
number={10},
pages={1972-1978},
abstract={In this paper, we present a method for evaluating the minimum free Chernov distance of trellis-codes for a discrete memoryless channels (DMC). In order to design an efficient trellis-code for the DMC, we need to evaluate the minimum free Chernov distance of the target code. However, the lack of the additive property of the Chernov distance prevents a conventional branch-and-bound search for evaluating the minimum distance. To overcome the difficulty, we present a lower bound on the Chernov distance with an additive property. The lower bound plays a key role in the minimum distance evaluation algorithm presented here. By using the proposed algorithm, we have derived the minimum free Chernov distance of some binary linear convolutional codes over Z-channel.},
keywords={},
doi={},
ISSN={},
month={October},}

Copy

TY - JOUR
TI - A Method for Evaluating Minimum Free Chernov Distance of Trellis-Codes for Discrete Memoryless Channel
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1972
EP - 1978
AU - Tadashi WADAYAMA
AU - Koichiro WAKASUGI
AU - Masao KASAHARA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E81-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 1998
AB - In this paper, we present a method for evaluating the minimum free Chernov distance of trellis-codes for a discrete memoryless channels (DMC). In order to design an efficient trellis-code for the DMC, we need to evaluate the minimum free Chernov distance of the target code. However, the lack of the additive property of the Chernov distance prevents a conventional branch-and-bound search for evaluating the minimum distance. To overcome the difficulty, we present a lower bound on the Chernov distance with an additive property. The lower bound plays a key role in the minimum distance evaluation algorithm presented here. By using the proposed algorithm, we have derived the minimum free Chernov distance of some binary linear convolutional codes over Z-channel.
ER -