Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Fundamenta Informaticae

1 2008

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On the Generation of Aperiodic and Periodic Necklaces via T-augmentation

Gulliver T.A., Makwakwa I., Speidel U.

Fundamenta Informaticae

2008

Vol. 83, nr 1-2

91-107

In a recent report, Gulliver and Speidel showed that complete sets of aperiodic and - in some cases periodic - necklaces can be generated for arbitrary lengths as fixed-length subsets of variable-length T-codes. The T-codes to which they applied this observation were specifically T-codes constructed by systematic T-augmentation, that is by T-augmentation sequences in which each T-expansion parameter is 1 (simple T-augmentation) and where the T-codes A(p1,p2,1/4,pi) at each T-augmentation level i do not contain any codewords shorter than pi (strictly minimal T-augmentation). This present paper generalizes their result to arbitrary T-codes and formalizes their earlier result as a special case of the general result.