Best short rate 1/2 tailbiting codes for the bit-error rate criterion

DOI10.1109/26.843127MaRDI QIDQ2732983zbMATH OpenOpenAlexFDO

Authors John B. Anderson

Publication date 14 May 2002

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

importance samplingconvolutional codesMonte Carlo integrationerror correction codingtrellis codesmaximum a posteriori probability decodingminimum bit-error rate

Mathematics Subject Classification ID

Convolutional codes (94B10) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• On Tail Biting Convolutional Codes
• A note on systematic tailbiting encoders
• Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
• scientific article; zbMATH DE number 3934930
• A note on tailbiting codes and their feedback encoders

Cited in

(7)

• On the minimum bit-error rate of linear codes
• Analytic Expressions for the Bit Error Probabilities of Rate-<tex>$1/2$</tex>Memory<tex>$2$</tex>Convolutional Encoders
• Optimal and near-optimal encoders for short and moderate-length tail-biting trellises
• A BEAST for Prowling in Trees
• scientific article; zbMATH DE number 3934930 (Why is no real title available?)
• A note on systematic tailbiting encoders
• Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes

This page was built for publication: Best short rate 1/2 tailbiting codes for the bit-error rate criterion

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