Further Results on Convolutional Code Search for Block-Fading Channels

DOI10.1109/TIT.2004.828146MaRDI QIDQ3546710zbMATH OpenFDO

Authors Marco Chiani, Andrea Conti, Velio Tralli

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40) Convolutional codes (94B10)

Recommendations

• Evaluating the performance of convolutional codes over block fading channels
• Some extended results on the search for good convolutional codes
• Convolutional codes for channels with fading
• On coding for block fading channels
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm

Cited in

(8)

• Convolutional-block coding in channels with decision feedback
• Convolutional codes for channels with fading
• Extension of coefficients for (n, k, m) convolutional-code-based packet loss recovery
• On the design and selection of convolutional codes for an uninterleaved, bursty Rician channel
• Some extended results on the search for good convolutional codes
• Evaluating the performance of convolutional codes over block fading channels
• scientific article; zbMATH DE number 1456807 (Why is no real title available?)
• Pragmatic space-time codes for cooperative relaying in block fading channels

This page was built for publication: Further Results on Convolutional Code Search for Block-Fading Channels

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