A constrained system is presented by a finite-state labeled graph. For such systems, we focus on block-type-decodable encoders, comprising three classes known as block, block-decodable, and deterministic encoders. Franaszek gives a sufficient condition which guarantees the equality of the optimal rates of block-decodable and deterministic encoders for the same block length. In this paper, we in...

A (v, k, λ) optical orthogonal code C is a family of (0, 1) sequences of length v and weight k satisfying the following correlation properties: (1) ∑ 0≤t≤v−1xtxt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C and any integer i ̸≡ 0 (mod v); (2) ∑ 0≤t≤v−1xtyt+i ≤ λ for any x = (x0, x1, . . . , xv−1) ∈ C, y = (y0, y1, . . . , yv−1) ∈ C with x ̸= y, and any integer i, where the subscripts are taken mo...

Infrastructure resilience is a priority for homeland security in many nations around the globe. This paper describes a new approach for quantitatively assessing the resilience of critical infrastructure systems. The mathematics of optimal control design provides the theoretical foundation for this methodology. This foundation enables the inclusion of recovery costs within the resilience assessm...

We present new constructions for (n, w, λ) optical orthogonal codes (OOC) using techniques from finite projective geometry. In one case codewords correspond to (q − 1)-arcs contained in Baer subspaces (and, in general, kth-root subspaces) of a projective space. In the other construction, we use sublines isomorphic to PG(1, q) lying in a projective plane isomorphic to PG(1, qk), k > 1. Our const...

Nine new 2-D OOCs are presented here, all sharing the common feature of a code size that is much larger in relation to the number of time slots than those of constructions appearing previously in the literature. Each of these constructions is either optimal or asymptotically optimal with respect to either the original Johnson bound or else a non-binary version of the Johnson bound introduced in...

Two new systematic authentication code based on the Gray map over a Galois ring are introduced. The first introduced code attains optimal impersonation and substitution probabilities. The second code improves space sizes but it does not attain optimal probabilities. Besides it is conditioned to the existence of a special class of bent maps on Galois rings.

The free-boundary and the martingale approach are competitive methods of solving discounted optimal stopping problems for one-dimensional time-homogeneous regular diffusion processes on infinite time intervals. We provide a missing link showing the equivalence of these approaches for a problem, where the optimal stopping time is equal to the first exit time of the underlying process from a regi...

The paper by Hernandez-Guzman and Santibanez is an interesting contribution to the induction motor field oriented control (FOC) literature. Standard FOC schemes can only prove local asymptotic regulation to the speed and flux references. The authors modify the classical indirect voltage-fed FOC methodology and propose the use of a saturated PI velocity control loop to ensure global asymptotic r...

Novel synchronous coding schemes are introduced and relationships between optimal synchronous codes and Huffman codes are also discussed. Although the problem of existence of optimal synchronous codes has not been resolved yet, we show that any synchronous code can consider as an optimal synchronous code for some information source and that there always exist optimal synchronous codes for the i...