On the performance evaluation of trellis codes
From MaRDI portal
Recommendations
Cited in
(13)- Computation of distributions and their moments in the trellis
- Pipeline decoding of embedded trellis codes: Error-tolerance analysis
- Probabilistic construction of large constraint length trellis codes for sequential decoding
- Design and analysis of trellis codes for orthogonal signal sets
- Performance evaluation of coded modulation schemes based on binary lattices
- An algorithm for computing the distance spectrum of trellis codes
- Structure, optimization, and realization of FFSK trellis codes
- scientific article; zbMATH DE number 1026585 (Why is no real title available?)
- scientific article; zbMATH DE number 1482965 (Why is no real title available?)
- Bounds on the a priori index crossover probabilities for trellis-based channel codes
- scientific article; zbMATH DE number 1511968 (Why is no real title available?)
- Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes
- Distance spectra and upper bounds on error probability for trellis codes
This page was built for publication: On the performance evaluation of trellis codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030718)