Path partitions and forward-only trellis algorithms

DOI10.1109/TIT.2002.806140MaRDI QIDQ4679878zbMATH OpenOpenAlexFDO

Authors Aleksandar Kavčić, Xi-Ao Ma

Publication date 31 May 2005

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

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

Mathematics Subject Classification ID

Convolutional codes (94B10) Decoding (94B35)

Recommendations

• Efficient algorithms for path partitions
• Improved algorithms for path partition and related problems
• Efficient algorithms for some path partitioning problems
• On the path partition of graphs
• Path partitions of hypercubes
• Parameterizing path partitions
• Approximation algorithms for the directed path partition problems
• The path partition problem and related problems in bipartite graphs
• Path partitionable graphs
• Algorithms for tolerated Tverberg partitions

Cited in

(2)

• Computation of distributions and their moments in the trellis
• Memory-reduced maximum a posteriori probability decoding for high-throughput parallel turbo decoders

This page was built for publication: Path partitions and forward-only trellis algorithms

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