Cyclically Indecomposable Triple Systems that are Decomposable Martin Grüttmüller Institut für Mathematik, Universität Rostock In this talk, we construct, by using Skolem-type and Rosa-type sequences, cyclically indecomposable two-fold triple systems TS2(v) for all admissible orders. We also investigate exhaustively the cyclically indecomposable triple systems TSλ(v) for λ = 2, v ≤ 33 and λ = 3...

Brevity is the soul of wit. William Shakespeare A cyclically permutable code is a set of codewords having the property that no codeword is a cyclic shift of another codeword. We study the problem of constructing cyclically permutable codes of large size and low correlation. Cyclically permutable codes are used in code-division multiple-access systems realized by e.g. direct-sequence modulation ...

A cyclically permutable code is a binary code whose codewords are cyclically distinct and have full cyclic order. An important class of these codes are the constant weight cyclically permutable codes. In a code of this class all codewords have the same weight w. These codes have many applications, including in optical code-division multiple-access communication systems and in constructing proto...

Thermal manipulation during embryogenesis was previously reported to decrease the occurrence of ascites and to potentially improve cold tolerance of broilers. The objective of our study was to explore the effects of the interaction of cold incubation temperatures and cool ambient temperatures until 21 d of age on performance and body temperature. Ross 308 eggs were incubated either under contro...

We propose a simple strategy to generate multiple interleavers. As suggested in literature, using user-distinct interleavers is an effective means to separate multiple users, if applied in addition to user-specific spreading codes in code division multiple access (CDMA). In this paper we particularly focus on interleave division multiple access (IDMA), which has a close relation to CDMA, but us...

In sequential pattern mining, the support of the sequential pattern for the transaction database is defined only by the fraction of the customers supporting this sequence, which is known as the customer support. In this paper, a new parameter is introduced for each customer, called as repetition support, as an additional constraint to specify the minimum number of repetitions of the patterns by...

A general theorem is proved showing how to ohtain a constant-weight binary cyclic code from a p-ary linear cyclic code, where p is a prime,. by using a representation of Cl;(p) as cyclic shifts of a binary p-tuple. Based on this theorem, constructions are given for four classes of binary constant-weight codes. The first two classes are shown to achieve the Johnson upper bound on minimum distanc...