EUR 55,14
Quantità: Più di 20 disponibili
Aggiungi al carrelloCondizione: New.
Condizione: New. pp. 148.
EUR 57,85
Quantità: 5 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. Group and Loop Algebras over Finite Fields | Raul Antonio Ferraz (u. a.) | Taschenbuch | 148 S. | Englisch | 2015 | Scholars' Press | EAN 9783639512687 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: preigu.
EUR 155,14
Quantità: 1 disponibili
Aggiungi al carrellopaperback. Condizione: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
EUR 67,90
Quantità: 2 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -In this, the 15th year of the 21st century, the need to translate plain text into code and to transmit securely, and the plethora of uses to which encryption is applied, needs no amplification. Recent methods have produced so-called cyclic codes, which have the property that if (a_1,a_2,a_3,.,a_n) is a code word, then so is the cyclic shift (a_n,a_1,a_2,.,a_{n-1}). The realization that such a code is an ideal in the group algebra of a cyclic group has motivated a large body of research into using group algebras to produce codes. In this area, the central theme is ``efficiency,'' a term that describes the need to maximize simultaneously both the Hamming distance between code words and the dimension of the code. Since an ideal in a semisimple group algebra KG corresponds to a central idempotent, and since a central idempotent is the sum of idempotents that generate the simple components of KG, the need to find these simple components is clear. This is the theme of the present monograph, which will interest many algebraists, including those who study Moufang loops and alternative rings. The groups studied are the building blocks of loops whose loop rings are alternative. 148 pp. Englisch.
Da: Majestic Books, Hounslow, Regno Unito
EUR 106,71
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. Print on Demand pp. 148.
Da: Biblios, Frankfurt am main, HESSE, Germania
EUR 108,00
Quantità: 4 disponibili
Aggiungi al carrelloCondizione: New. PRINT ON DEMAND pp. 148.
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
EUR 67,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -In this, the 15th year of the 21st century, the need to translate plain text into code and to transmit securely, and the plethora of uses to which encryption is applied, needs no amplification. Recent methods have produced so-called cyclic codes, which have the property that if (a_1,a_2,a_3,.,a_n) is a code word, then so is the cyclic shift (a_n,a_1,a_2,.,a_{n-1}). The realization that such a code is an ideal in the group algebra of a cyclic group has motivated a large body of research into using group algebras to produce codes. In this area, the central theme is ``efficiency,'' a term that describes the need to maximize simultaneously both the Hamming distance between code words and the dimension of the code. Since an ideal in a semisimple group algebra KG corresponds to a central idempotent, and since a central idempotent is the sum of idempotents that generate the simple components of KG, the need to find these simple components is clear. This is the theme of the present monograph, which will interest many algebraists, including those who study Moufang loops and alternative rings. The groups studied are the building blocks of loops whose loop rings are alternative.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 148 pp. Englisch.
Da: AHA-BUCH GmbH, Einbeck, Germania
EUR 67,90
Quantità: 1 disponibili
Aggiungi al carrelloTaschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - In this, the 15th year of the 21st century, the need to translate plain text into code and to transmit securely, and the plethora of uses to which encryption is applied, needs no amplification. Recent methods have produced so-called cyclic codes, which have the property that if (a_1,a_2,a_3,.,a_n) is a code word, then so is the cyclic shift (a_n,a_1,a_2,.,a_{n-1}). The realization that such a code is an ideal in the group algebra of a cyclic group has motivated a large body of research into using group algebras to produce codes. In this area, the central theme is ``efficiency,'' a term that describes the need to maximize simultaneously both the Hamming distance between code words and the dimension of the code. Since an ideal in a semisimple group algebra KG corresponds to a central idempotent, and since a central idempotent is the sum of idempotents that generate the simple components of KG, the need to find these simple components is clear. This is the theme of the present monograph, which will interest many algebraists, including those who study Moufang loops and alternative rings. The groups studied are the building blocks of loops whose loop rings are alternative.