WE2.R8.2

An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes

Zita Abreu, University of Aveiro, Portugal; Julia Lieb, TU Ilmenau, Germany; Michael Schaller, University of Zurich, Switzerland
Session:
Convolutional and Streaming Codes 2
Track:
2: Modern Coding Theory
Location:
Omega
Presentation Time:
Wed, 10 Jul, 11:50 - 12:10
Session Chair:
Wenhui Sui, UCLA
Abstract
The most famous error-decoding algorithm for convolutional codes is the Viterbi algorithm. In this paper, we present a new reduced complexity version of this algorithm which can be applied to a class of binary convolutional codes with optimum column distances called $k$-partial simplex convolutional codes.
Session WE2.R8
WE2.R8.1: Streaming Codes for Three-Node Relay Networks With Burst Erasures
Vinayak Ramkumar, Tel Aviv University, Israel; Myna Vajha, Indian Institute of Technology Hyderabad, India; Nikhil Krishnan Muralee Krishnan, Indian Institute of Technology Palakkad, India
WE2.R8.2: An Improved Viterbi Algorithm for a Class of Optimal Binary Convolutional Codes
Zita Abreu, University of Aveiro, Portugal; Julia Lieb, TU Ilmenau, Germany; Michael Schaller, University of Zurich, Switzerland
WE2.R8.3: On Streaming Codes for Simultaneously Correcting Burst and Random Erasures
Shobhit Bhatnagar, Indian Institute of Science, India; Biswadip Chakraborty, Qualcomm, India; P Vijay Kumar, Indian Institute of Science, India
WE2.R8.4: Subset Adaptive Relaying for Streaming Erasure Codes
Muhammad Ahmad Kaleem, Gustavo Kasper Facenda, Ashish Khisti, University of Toronto, Canada
Resources
View Manuscript