The predictable degree property and row reducedness for systems over a finite ring
From MaRDI portal
(Redirected from Publication:998209)
Recommendations
Cites work
- 4-phase sequences with near-optimum correlation properties
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Canonical kernel representations for behaviors over finite Abelian groups
- Fast projection methods for minimal design problems in linear system theory
- From time series to linear system, II. Exact modelling
- From time series to linear system. I: Finite dimensional linear time invariant systems
- Generalized GMW quadriphase sequences satisfying the Elch bound with equality
- scientific article; zbMATH DE number 3973001 (Why is no real title available?)
- scientific article; zbMATH DE number 3460471 (Why is no real title available?)
- scientific article; zbMATH DE number 1100439 (Why is no real title available?)
- scientific article; zbMATH DE number 3014797 (Why is no real title available?)
- scientific article; zbMATH DE number 3392596 (Why is no real title available?)
- LDPC Codes Over Rings for PSK Modulation
- Linear multivariable systems
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Modular and \(p\)-adic cyclic codes
- On minimal realization over a finite chain ring
- Paradigms and puzzles in the theory of dynamical systems
- Reed–Solomon List Decoding From a System-Theoretic Perspective
- Some structural properties of convolutional codes over rings
- System-theoretic properties of convolutional codes over rings
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codes
Cited in
(12)- Finite multidimensional behaviors
- Bilinear forms graphs over residue class rings
- List decoding of convolutional codes over integer residue rings
- State representations of convolutional codes over a finite ring
- Minimal Trellis Construction for Finite Support Convolutional Ring Codes
- The dual of convolutional codes over \(\mathbb {Z}_{p^r}\)
- On MDS convolutional codes over \(\mathbb{Z}_{p^r}\)
- An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
- Noncatastrophic convolutional codes over a finite ring
- Minimal Gröbner bases and the predictable leading monomial property
- Convolutional codes over finite chain rings, MDP codes and their characterization
- On the existence of non-catastrophic \(p\)-encoders of \((2, 1)\) convolutional codes over \(\mathbb{Z}_{p^2}\)
This page was built for publication: The predictable degree property and row reducedness for systems over a finite ring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998209)