Optimal Construction for Decoding 2D Convolutional Codes over an Erasure Channel

Abstract

In general, the problem of building optimal convolutional codes under a certain criteria is hard, especially when size field restrictions are applied. In this paper, we confront the challenge of constructing an optimal 2D convolutional code when communicating over an erasure channel. We propose a general construction method for these codes. Specifically, we provide an optimal construction where the decoding method presented in the bibliography is considered.

Keywords

• decoding
• 2D convolutional codes
• complexity
• linear decoding
• optimal construction