Name
Abstract | ||
|---|---|---|
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 shiftsearch 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. |
Year | Venue | Keywords |
|---|---|---|
2010 | JOURNAL OF INFORMATION SCIENCE AND ENGINEERING | error pattern,DSP,finite field,quadratic residue,syndrome |
Field | DocType | Volume |
Lookup table,Quadratic residue,Finite field,Berlekamp–Welch algorithm,Sequential decoding,Search algorithm,Computer science,Algorithm,Decoding methods,List decoding | Journal | 26 |
Issue | ISSN | Citations |
5 | 1016-2364 | 2 |
PageRank | References | Authors |
0.40 | 10 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yan-Haw Chen | 1 | 50 | 7.86 |
| Chih-Hua Chien | 2 | 8 | 1.26 |
| Chien-Hsiang Huang | 3 | 9 | 1.28 |
| Trieu-Kien Truong | 4 | 382 | 59.00 |
| Ming-haw Jing | 5 | 33 | 6.99 |