Sphere-Packing Bounds for Convolutional Codes

DOI10.1109/TIT.2004.836672MaRDI QIDQ3547565zbMATH OpenOpenAlexFDO

Authors Eirik Rosnes, Øyvind Ytrehus

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.836672

Mathematics Subject Classification ID

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

Recommendations

• Some convolutional codes whose free distances are maximal
• Two 16-state, rate R=2/4 trellis codes whose free distances meet the Heller bound
• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• scientific article; zbMATH DE number 5360805
• On maximum length convolutional codes under a trellis complexity constraint

Cited in

(8)

• On maximum length convolutional codes under a trellis complexity constraint
• Constructive spherical codes near the Shannon bound
• The sphere packing bound for memoryless channels
• scientific article; zbMATH DE number 1182944 (Why is no real title available?)
• scientific article; zbMATH DE number 65944 (Why is no real title available?)
• Sphere-bound-achieving coset codes and multilevel coset codes
• scientific article; zbMATH DE number 2088006 (Why is no real title available?)
• Heller-type bounds for the homogeneous free distance of convolutional codes over finite Frobenius rings

This page was built for publication: Sphere-Packing Bounds for Convolutional Codes

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