A decoding algorithm for 2D convolutional codes over the erasure channel
Julia Lieb, Raquel Pinto

TL;DR
This paper introduces a decoding algorithm for 2D convolutional codes over erasure channels, simplifying the process by reducing it to multiple 1D decoding steps, and offers tailored code constructions for improved performance.
Contribution
It presents a novel decoding algorithm for 2D convolutional codes over erasure channels and provides specific code constructions optimized for this method.
Findings
Decoding process is reduced to multiple 1D decoding steps.
Constructed 2D convolutional codes are tailored for the proposed decoding algorithm.
The approach enhances decoding efficiency over erasure channels.
Abstract
Two-dimensional (2D) convolutional codes are a generalization of (1D) convolutional codes, which are very appropriate for transmission over an erasure channel. In this paper, we present a decoding algorithm for 2D convolutional codes over this kind of channel by reducing the decoding process to several decoding steps with 1D convolutional codes. Moreover, we provide constructions of 2D convolutional codes that are specially taylored to our decoding algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
