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

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 ge...

Full description

Saved in:
Bibliographic Details
Published in:Axioms 2024-03, Vol.13 (3), p.197
Main Authors: Pinto, Raquel, Spreafico, Marcos, Vela, Carlos
Format: Article
Language:English
Subjects:
2D convolutional codes
Algorithms
Block codes
Codes
Communication
complexity
Convolutional codes
Decoding
linear decoding
Mathematical optimization
Mathematical research
optimal construction
Parity
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2075-1680
2075-1680
DOI:10.3390/axioms13030197