982 resultados para GF(2m)
Resumo:
By combining two previously generated null mutations, Ii° and M°, we produced mice lacking the invariant chain and H-2M complexes, both required for normal cell-surface expression of major histocompatibility complex class II molecules loaded with the usual diverse array of peptides. As expected, the maturation and transport of class II molecules, their expression at the cell surface, and their capacity to present antigens were quite similar for cells from Ii°M° double-mutant mice and from animals carrying just the Ii° mutation. More surprising were certain features of the CD4+ T cell repertoire selected in Ii°M° mice: many fewer cells were selected than in Ii+M° animals, and these had been purged of self-reactive specificities, unlike their counterparts in Ii+M° animals. These findings suggest (i) that the peptides carried by class II molecules on stromal cells lacking H-2M complexes may almost all derive from invariant chain and (ii) that H-2M complexes edit the peptide array displayed on thymic stromal cells in the absence of invariant chain, showing that it can edit, in vivo, peptides other than CLIP.
Resumo:
Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.
