An algorithm for computing the distance spectrum of trellis codes

DOI10.1109/49.29615MaRDI QIDQ3495029zbMATH OpenOpenAlexFDO

Authors Marc Rouanne, Daniel J. jun. Costello

Publication date 1989

Published in IEEE Journal on Selected Areas in Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/49.29615

zbMATH Keywords

allzero information sequencebidirectional stack algorithmbit-error probabilityConvolutional codesconvolutional encoderdistance spectrumfirst-event-error probabilitylinear codeminimum squared distancepathquasiregular codesstate diagramstrellis codesViterbi algorithm

Mathematics Subject Classification ID

Modulation and demodulation in information and communication theory (94A14) Channel models (including quantum) in information and communication theory (94A40) Linear codes (general theory) (94B05) Convolutional codes (94B10)

Recommendations

• scientific article; zbMATH DE number 1123085
• Distance spectra and upper bounds on error probability for trellis codes
• Efficient performance computations for trellis-coded modulation
• On the performance evaluation of trellis codes
• Distance spectrum analysis of space-time trellis-coded modulations in quasi-static rayleigh-fading channels

Cited in

(7)

• Efficient performance computations for trellis-coded modulation
• A fast algorithm for computing distance spectrum of convolutional codes
• Distance spectrum analysis of space-time trellis-coded modulations in quasi-static rayleigh-fading channels
• scientific article; zbMATH DE number 1116615 (Why is no real title available?)
• scientific article; zbMATH DE number 1123085 (Why is no real title available?)
• Distance spectra of convolutional codes over partial-response channels
• Distance spectra and upper bounds on error probability for trellis codes

This page was built for publication: An algorithm for computing the distance spectrum of trellis codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495029)