New algorithms for Toeplitz and Toeplitz-plus-Hankel are presented that are in the spirit of the “split” algorithms of Delsarte/Genin. It is shown that the split algorithms are related to ZW-factorizations like the classical algorithms are related to LU-factorizations. Special attention is paid to skewsymmetric Toeplitz, centrosymmetric Toeplitz-plus-Hankel and general Toeplitz-plus-Hankel matr...

1. Kristina Altmann, Hyperbolic lines in unitary space. 2. John Bamberg, Transitive m-systems. 3. Barbara Baumeister, The primitive permutation groups with a regular subgroup. 4. Rieuwert Blok, Extensions of isomorphisms for affine grassmannians over F2. 5. Matthew Brown, Tetradic sets of elliptic quadrics of PG(3, q) and generalized quadrangles of order (s, s2) with Property (G). 6. Julia Brow...

The canonical coding partition of a set of words is the finest partition such that the words contained in at least two factorizations of a same sequence belong to a same class. In the case the set is not uniquely decipherable, it partitions the set into one unambiguous class and other parts that localize the ambiguities in the factorizations of finite