Open Fe-r-oz opened 2 months ago
Classical Convolutional codes are fully implemented using Nemo. I have followed the Field Theoretic Implementation that was described in a paper, so that way, they can be described via Abstract Algebra.
TODO: look for properties of the convolutional codes that can be tested via FieldPolynomialRings.
TODO: I am exploring about Direct Summands and how to check whether a Free Module is a Direct Summand given the Finite Field.
Progress Update:
I had correspondence with authors of the paper of the code itself. I read the book and there is no mention of "free modules" at all, but they defined the it in terms of modules.
They have provided a definition in terms of Number theory that differs from what is provided in the book so I have requested further details.
Classical Convolutional Code