شماره ركورد كنفرانس :
4819
عنوان مقاله :
A new fast algorithm for decoding the [47,24,11] quadratic residue code
عنوان به زبان ديگر :
A new fast algorithm for decoding the [47,24,11] quadratic residue code
پديدآورندگان :
Roostaie Zeinab zeinab.roostaie@gmail.com Department of Mathematics, Faculty of Mathematical Sciences Shahrekord. Iran , Gholami Mohammad gholami-m@sci.sku.ac.ir Department of Mathematics, Faculty of Mathematical Sciences Shahrekord. Iran
كليدواژه :
error pattern , finite field , quadratic residue codes , syndrome
عنوان كنفرانس :
سومين همايش بين المللي تركيبيات، رمزنگاري و محاسبات
چكيده فارسي :
In this paper, we present a new method for decoding [47,24,11] quadratic residue (QR) code which is the reduction of the required memory compared to the full lookup table or other known algebraic decoding methods. The idea behind this decoding technique is based on the existence of a one-to-one relation between the syndrome and correctable error patterns. In this approach, errors are directly found from the table and no multiplication operation over a finite field is required. Because of using the cyclic structure of codes, weight of syndrome and a reduced lookup table, the proposed algorithm can be applied on many other cyclic codes.
چكيده لاتين :
In this paper, we present a new method for decoding [47,24,11] quadratic residue (QR) code which is the reduction of the required memory compared to the full lookup table or other known algebraic decoding methods. The idea behind this decoding technique is based on the existence of a one-to-one relation between the syndrome and correctable error patterns. In this approach, errors are directly found from the table and no multiplication operation over a finite field is required. Because of using the cyclic structure of codes, weight of syndrome and a reduced lookup table, the proposed algorithm can be applied on many other cyclic codes.
