Generalized column weights and equivalences of convolutional codes
From MaRDI portal
Publication:6580198
In this paper, the authors study the notion of generalized column weights of convolutional codes. This notion can be regarded as a natural extension of the notion of generalized weights of linear block codes. However, in the context of convolutional codes and in particular of the column distances, this concept is more involved and there is not an obvious way to define it. The authors investigate their properties and derived important fundamental properties for these weights.
Recommendations
Cites work
- Convolutional codes
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Generalized Column Distances
- Generalized Hamming weights for linear codes
- Generalized weights of convolutional codes
- scientific article; zbMATH DE number 3711820 (Why is no real title available?)
- Maximum distance separable convolutional codes
- On isometries for convolutional codes
- Optimal decoding of linear codes for minimizing symbol error rate (Corresp.)
- Strongly-MDS convolutional codes
- The weight distribution of irreducible cyclic codes with block lengths n₁ ((q^-1)/N)
This page was built for publication: Generalized column weights and equivalences of convolutional codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6580198)