2005/06/03 by A. S. Madhu, Madhu, A. S., Priti Shankar +1
Computer Science · Mathematics · #Cellular Automata and Applications #Coding theory and cryptography #Error Correcting Code Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.cs/0506009
5 pages, 2 figures, ISIT 2005
arxiv created 2005/06/03 · openalex publication_date 2005/06/03 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose two approximate algorithms for MAP decoding on tail-biting trellises. The algorithms work on a subset of nodes of the tail-biting trellis, judiciously selected. We report the results of simulations on an AWGN channel using the approximate algorithms on tail-biting trellises for the (24,12) Extended Golay Code and a rate 1/2 convolutional code with memory 6.