[[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 distance 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[[fileno]]2030174030020[[department]]電機工程學
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
[[abstract]]Commentson a paper by Rouanne and Costello Jr. (IEEE Trans. Inform. Theory, vol.34, p.10...
[[abstract]]Distance properties of trellis codes are of great importance for performance evaluation....
[[abstract]]Summary form only given. The authors let the number of fundamental paths of weight d in ...
Recently, the concept of active distances, originally introduced for binary convolutional codes, was...
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of r...
© 1963-2012 IEEE. We introduce a random coding technique for transmission over discrete memoryless c...
Distance spectrum (DS) calculation is a complicated task for general trellis codes. The DS is used t...
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expr...
It is well-known that CPM schemes themselves exhibit attractive spectral efficiencies and that combi...
It is well-known that CPM schemes themselves exhibit attractive spectral efficiencies and that combi...
The distance distribution of a binary code C is the sequence (G i n i=0 de ned as follows: Let G i (...
We introduce a random code construction for channel coding in which the codewords are constrained to...
An expurgated upper bound on the event error probability of trellis coded modulation is presented. T...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
[[abstract]]Commentson a paper by Rouanne and Costello Jr. (IEEE Trans. Inform. Theory, vol.34, p.10...
[[abstract]]Distance properties of trellis codes are of great importance for performance evaluation....
[[abstract]]Summary form only given. The authors let the number of fundamental paths of weight d in ...
Recently, the concept of active distances, originally introduced for binary convolutional codes, was...
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of r...
© 1963-2012 IEEE. We introduce a random coding technique for transmission over discrete memoryless c...
Distance spectrum (DS) calculation is a complicated task for general trellis codes. The DS is used t...
Raptor code ensembles with linear random outer codes in a fixed-rate setting are considered. An expr...
It is well-known that CPM schemes themselves exhibit attractive spectral efficiencies and that combi...
It is well-known that CPM schemes themselves exhibit attractive spectral efficiencies and that combi...
The distance distribution of a binary code C is the sequence (G i n i=0 de ned as follows: Let G i (...
We introduce a random code construction for channel coding in which the codewords are constrained to...
An expurgated upper bound on the event error probability of trellis coded modulation is presented. T...
Our research is focused on mapping binary sequences to permutation sequences. It is established that...
[[abstract]]A general formula for the asymptotic largest minimum distance (in block length) of deter...
[[abstract]]Commentson a paper by Rouanne and Costello Jr. (IEEE Trans. Inform. Theory, vol.34, p.10...