WE1.R8.1

Algorithms for Computing the Free Distance of Convolutional Codes

Zita Abreu, University of Aveiro, Portugal; Joachim Rosenthal, Michael Schaller, University of Zurich, Switzerland
Session:
Convolutional and Streaming Codes 1
Track:
2: Modern Coding Theory
Location:
Omega
Presentation Time:
Wed, 10 Jul, 09:50 - 10:10
Session Chair:
Vijay Kumar,
Abstract
The free distance of a convolutional code is a reliable indicator of its performance. However its computation is not an easy task. In this paper, we present some algorithms to compute the free distance with good efficiency that work for convolutional codes of all rates and over any field. Furthermore we discuss why an algorithm which is claimed to be very efficient is incorrect.
Session WE1.R8
WE1.R8.1: Algorithms for Computing the Free Distance of Convolutional Codes
Zita Abreu, University of Aveiro, Portugal; Joachim Rosenthal, Michael Schaller, University of Zurich, Switzerland
WE1.R8.2: Linearity-Enhanced Serial List Decoding of Linearly Expurgated Tail-Biting Convolutional Codes
Wenhui Sui, Brendan Towell, Zihan Qu, Eugene Min, Richard Wesel, University of California, Los Angeles, United States
WE1.R8.3: Complementary Exclusion of Full Polynomials to Enable Dual List Decoding of Convolutional Codes
Zihan Qu, Amaael Antonini, Wenhui Sui, Eugene Min, Arthur Yang, Richard Wesel, University of California, Los Angeles, United States
WE1.R8.4: On Streaming Codes for Burst and Random Errors
Shobhit Bhatnagar, P Vijay Kumar, Indian Institute of Science, India
Resources
View Manuscript