For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Average Distance Structures of Trellis Codes
Chi-Chao CHAO Mao-Ching CHIU
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1996/04/25
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Information Theory and Coding Theory
trellis codes, random coding, distance structure, nimimum distance,
Full Text: PDF(531.6KB)>>
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.