Bounds on the a priori index crossover probabilities for trellis-based channel codes

DOI10.1109/18.850668zbMATH Open0997.94537OpenAlexW2112373306MaRDI QIDQ4501751FDOQ4501751

Authors: Benjamin J. Belzer 

Publication date: 7 September 2000

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

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

Recommendations

• Tighter bounds on the error probability of fixed convolutional codes
• On the probability of error of convolutional codes
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Computing upper bounds to error probability of coded modulation schemes
• On the performance evaluation of trellis codes

zbMATH Keywords

source codingunion boundsconvolutional codingtrellis-coded modulationindex crossover probabilities

Mathematics Subject Classification ID

Source coding (94A29) Convolutional codes (94B10) Modulation and demodulation in information and communication theory (94A14) Combined modulation schemes (including trellis codes) in coding theory (94B12)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Bounds on the a priori index crossover probabilities for trellis-based channel codes

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