2 resultados para permissible permutation

em Brock University, Canada


Relevância:

10.00% 10.00%

Publicador:

Resumo:

In 1973, Kathleen Pearson offered a pivotal first step into understanding deception in competitive sport and its many intricacies. However, the analysis falls short of truly deciphering this widespread phenomenon. By creating a taxonomy based on Torres (2000) understanding of various types of skills in an athletic contest, a wider array of deceptive practices are encompassed. Once the taxonomy is put forth, weighing the categories against the three-pronged ethical permissibility test established utilizing elements from formalism, conventionalism and broad internalism sheds lights on what deceptive practices should be deemed ethically permissible for use and which tactics should not be a part of an athlete’s repertoire. By understanding which categories of deception are permissible, the most fair and athletically excellent contest can be created between the opposing players of teams.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.