Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes

DOI10.1109/18.971743MaRDI QIDQ4544768zbMATH OpenOpenAlexFDO

Authors R. Garello, Guido Montorsi, Sergio Benedetto, Dariush Divsalar, Fabrizio Pollara

Publication date 4 August 2002

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/7ca42fca08f5005988afdde62b2e677124f440f9

Mathematics Subject Classification ID

Error probability in coding theory (94B70) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Recommendations

• On the performance evaluation of trellis codes
• Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
• Signal constellations for bit-interleaved coded modulation
• Unveiling turbo codes: some results on parallel concatenated coding schemes
• Best short rate 1/2 tailbiting codes for the bit-error rate criterion

Cited in

(4)

• On the Optimality of the Binary Reflected Gray Code
• Recursive GF\((2^N)\) encoders using left-circulate function for optimum PSK-TCM schemes
• Minimal and systematic convolutional codes over finite Abelian groups
• Optimum commutative group codes

This page was built for publication: Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes

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