Convolutional codes are considered with code sequences modeled as semi-infinite Laurent series. It is well known that a convolutional code C over a finite group G has a minimal trellis representation that can be derived from code sequences. It is also well known that, for the case that G is a finite field, any polynomial encoder of C can be algebraically manipulated to yield a minimal polynomial encoder whose c...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |