Pages that link to "Item:Q3129471"
From MaRDI portal
The following pages link to An efficient algorithm for constructing minimal trellises for codes over finite abelian groups (Q3129471):
Displaying 5 items.
- On the covering radius of some modular codes (Q476335) (← links)
- On MDS convolutional codes over \(\mathbb{Z}_{p^r}\) (Q517269) (← links)
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings (Q522204) (← links)
- Minimal Gröbner bases and the predictable leading monomial property (Q609485) (← links)
- The predictable degree property and row reducedness for systems over a finite ring (Q998209) (← links)
