Average Distance Structures of Trellis Codes

Chi-Chao CHAO; Mao-Ching CHIU

Average Distance Structures of Trellis Codes

Chi-Chao CHAO, Mao-Ching CHIU

Full Text Views

0

Cite this

Summary :

Distance properties of trellis codes are of great importance for performance evaluation. In this paper, we use random coding analysis to study the average distance structures of trellis codes. The generating function enumerating the average number of error events of each distances is fully determined in the ensemble of time-varying trellis codes. The results obtained can be used to predict the growth rate of the number of error events at large distance and hence determine the signal-to-noise range in which the transfer function bound for error performance is convergent. Other applications of the average distance structure include a Gilbert-type lower bound on minimum distance.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E79-A No.4 pp.585-591

Publication Date: 1996/04/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Information Theory and Coding Theory

Cite this

Copy

Chi-Chao CHAO, Mao-Ching CHIU, "Average Distance Structures of Trellis Codes" in IEICE TRANSACTIONS on Fundamentals, vol. E79-A, no. 4, pp. 585-591, April 1996, doi: .
Abstract: Distance properties of trellis codes are of great importance for performance evaluation. In this paper, we use random coding analysis to study the average distance structures of trellis codes. The generating function enumerating the average number of error events of each distances is fully determined in the ensemble of time-varying trellis codes. The results obtained can be used to predict the growth rate of the number of error events at large distance and hence determine the signal-to-noise range in which the transfer function bound for error performance is convergent. Other applications of the average distance structure include a Gilbert-type lower bound on minimum distance.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e79-a_4_585/_p

Copy

@ARTICLE{e79-a_4_585,
author={Chi-Chao CHAO, Mao-Ching CHIU, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Average Distance Structures of Trellis Codes},
year={1996},
volume={E79-A},
number={4},
pages={585-591},
abstract={Distance properties of trellis codes are of great importance for performance evaluation. In this paper, we use random coding analysis to study the average distance structures of trellis codes. The generating function enumerating the average number of error events of each distances is fully determined in the ensemble of time-varying trellis codes. The results obtained can be used to predict the growth rate of the number of error events at large distance and hence determine the signal-to-noise range in which the transfer function bound for error performance is convergent. Other applications of the average distance structure include a Gilbert-type lower bound on minimum distance.},
keywords={},
doi={},
ISSN={},
month={April},}

Copy

TY - JOUR
TI - Average Distance Structures of Trellis Codes
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 585
EP - 591
AU - Chi-Chao CHAO
AU - Mao-Ching CHIU
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E79-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 1996
AB - Distance properties of trellis codes are of great importance for performance evaluation. In this paper, we use random coding analysis to study the average distance structures of trellis codes. The generating function enumerating the average number of error events of each distances is fully determined in the ensemble of time-varying trellis codes. The results obtained can be used to predict the growth rate of the number of error events at large distance and hence determine the signal-to-noise range in which the transfer function bound for error performance is convergent. Other applications of the average distance structure include a Gilbert-type lower bound on minimum distance.
ER -