On classes of convolutional codes that are not asymptotically catastrophic
From MaRDI portal
Recommendations
- Asymptotically catastrophic convolutional codes
- Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes
- On the enumeration and generation of nonweight equivalent rate \(\frac12\) convolutional codes
- On a class of convolutional codes
- scientific article; zbMATH DE number 3985113
Cited in
(15)- Existence of time-invariant convolutional codes with transmission rate \(2/c\) for \(c \geq{}4\) attaining the Costello bound
- On maximum length convolutional codes under a trellis complexity constraint
- Convolutional codes: techniques of construction
- Non-catastrophicity in multidimensional convolutional coding
- Nonbinary quantum convolutional codes derived from negacyclic codes
- On negacyclic MDS-convolutional codes
- scientific article; zbMATH DE number 3959275 (Why is no real title available?)
- Asymptotically catastrophic convolutional codes
- Nonbinary convolutional codes derived from group character codes
- On a class of convolutional codes
- On classes of rate k/(k+1) convolutional codes and their decoding techniques
- Tight bounds on the minimum average weight per branch for rate (N-1)/N convolutional codes
- The asymptotic average degree of an augmented polynomial
- On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)
- A class of new group character codes and convolutional codes
This page was built for publication: On classes of convolutional codes that are not asymptotically catastrophic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503549)
