On the reachable sets of non-autonomous linear control systems
We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.
We are extending to linear recurrent codes, i.e., to time-varying convolutional codes, most of the classic structural properties of fixed convolutional codes. We are also proposing a new connection between fixed convolutional codes and linear block codes. These results are obtained thanks to a module-theoretic framework which has been previously developed for linear control.
We consider a distributed system in which the state q is governed by a parabolic equation and a pair of controls v = (h,k) where h and k play two different roles: the control k is of controllability type while h expresses that the state q does not move too far from a given state. Therefore, it is natural to introduce the control point of view. In fact, there are several ways to state and solve optimal control problems with a pair of controls h and k, in particular the Least Squares method...