Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Efficient Decoding of Systematic (23, 12, 7) and (41, 21, 9) Quadratic Residue Codes
Ist Teil von
Journal of Information Science and Engineering, 2010-09, Vol.26 (5), p.1831-1843
Ort / Verlag
Taipei: 社團法人中華民國計算語言學學會
Erscheinungsjahr
2010
Link zum Volltext
Quelle
Free E-Journal (出版社公開部分のみ）
Beschreibungen/Notizen
In this paper, a new algorithms decoding the (23, 12, 7) and the (41, 21, 9) Quadratic Residue (QR) codes are presented. The key ideas behind this decoding technique are based on one-to-one mapping between the syndromes ＂S_1＂ and correctable error patterns. Such algorithms determine the error locations directly by lookup tables without the operations of multiplication over a finite field. Moreover, the method of utilizing shift-search algorithm, to dramatically reduce the memory requirement is given for decoding QR codes. The algorithm has been verified through a software simulation that program in C-language. The new approach is modular, regular and naturally suitable for DSP software implementation.