Basic properties of multidimensional convolutional codes
An \(m\)-dimensional convolutional code of length \(n\) is defined as a \({\mathcal D}\)-submodule, \({\mathcal C}\), of the free module \({\mathcal D}^{n}\) where \({\mathcal D} = \mathbb{F}[z_{1},\dots, z_{m}]\) is a polynomial ring in \(m\) indeterminates over a finite field \(\mathbb{F}\). The paper considers algebraic and distance properties of multidimensional convolutional codes. Here it turns out that not only their algebraic structure is different from the structure of usual one-dimensional convolutional codes, but this is also true for their distance properties. The author gives also some code constructions fulfilling certain lower distance bounds. For the entire collection see [Zbl 0960.00082].
- Multidimensional Convolutional Codes
- Multidimensional convolutional codes
- scientific article; zbMATH DE number 1314690
- Multidimensional Quasi-Cyclic and Convolutional Codes
- scientific article; zbMATH DE number 1189002
- Convolutional codes and complexity
- On a class of convolutional codes
- scientific article; zbMATH DE number 3865152
- New properties of convolutional codes and some applications to communication systems
- Convolutional codes
- The predictable degree property and minimality in multidimensional convolutional coding
- Multidimensional quasi-twisted codes: equivalent characterizations and their relation to multidimensional convolutional codes
- Multidimensional convolutional codes
- Multidimensional Convolutional Codes
- Basic concepts and mathematical aspects in channel coding: multialternative rules
This page was built for publication: Basic properties of multidimensional convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2776538)
