On Skew Convolutional and Trellis Codes
You should be logged in to see the presentation
Two new classes of skew codes over a finite field F are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew polynomials over F. The skew convolutional codes can be represented as periodic time-varying ordinary convolutional codes. The skew trellis codes are in general nonlinear over F. Every code from both classes has a code trellis and can be decoded by Viterbi or BCJR algorithms.
Technical University of Munich, Germany
There are still no questions. Be the first to post one!
You should be logged in order to use this feature.
Download from Proceedings of 2020 IEEE INFORMATION THEORY WORKSHOP