On Even Length Codes over Finite Rings: Basics, Concepts,Theory and examples - Couverture souple

Hamoda, Mohammad

 
9783659257292: On Even Length Codes over Finite Rings: Basics, Concepts,Theory and examples
Couverture souple
ISBN 10 : 365925729X ISBN 13 : 9783659257292
Editeur : LAP LAMBERT Academic Publishing, 2012

Synopsis

Codes over finite rings have been studied in the early 1970. A great deal of attention has been given to codes over finite rings from 1990, because of their new role in algebraic coding theory and their successful application. Linear and cyclic codes over rings have recently aroused great interest because of their new roles in coding theory and their successful application in combined coding and modulation. There has been much interest and research in codes over finite rings of even length. In recent years, more work has been done for the structure of negacyclic / constacyclic codes of even length over finite rings. Ranks, minimal spannig sets, and a Gray mapps will be useful on the studying these codes. It will be interesting to construct a decoding algorithm for these codes that works for any length n.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Codes over finite rings have been studied in the early 1970. A great deal of attention has been given to codes over finite rings from 1990, because of their new role in algebraic coding theory and their successful application. Linear and cyclic codes over rings have recently aroused great interest because of their new roles in coding theory and their successful application in combined coding and modulation. There has been much interest and research in codes over finite rings of even length. In recent years, more work has been done for the structure of negacyclic / constacyclic codes of even length over finite rings. Ranks, minimal spannig sets, and a Gray mapps will be useful on the studying these codes. It will be interesting to construct a decoding algorithm for these codes that works for any length n.

Biographie de l'auteur

Mohammad Hamoda, lecturer in Al-Aqsa University, Palestine. My field of study is Noncommutative Algebra, Algebraic Coding Theory.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
LAP LAMBERT Academic Publishing
Date d'édition
2012
Langue
anglais
ISBN 10 
365925729X
ISBN 13 
9783659257292
Reliure
Broché
Nombre de pages
112
Coordonnées du fabricant
non disponible
Personne responsable
KreGa Onlinehandel GmbH
4950000000000
info@krega-onlinehandel.de

Birkenweg 31
Brakel
33034
Allemagne