DECODING THE (73, 37, 13) QUADRATIC RESIDUE CODE

Authors
CHEN X REED IS TRUONG TK
Citation
X. Chen et al., DECODING THE (73, 37, 13) QUADRATIC RESIDUE CODE, IEE proceedings. Computers and digital techniques, 141(5), 1994, pp. 253-258
Citations number
6
Categorie Soggetti
Computer Sciences","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
IEE proceedings. Computers and digital techniques → ACNP
ISSN journal
13502387
Volume
141
Issue
5
Year of publication
1994
Pages
253 - 258
Database
ISI
SICI code
1350-2387(1994)141:5<253:DT(31Q>2.0.ZU;2-X
Abstract
Algebraic approaches to the decoding of the quadratic residue (QR) cod es were studied recently [1-3]. In Reference 1 a decoding algorithm wa s given for the (41, 21, 9) binary QR code. Here, some new more genera l properties are found for the syndromes of the subclass of binary QR codes of length n = 8m + 1. Using these properties, the new theorems n eeded to decode this subclass of the QR codes are obtained and proved. As an example of the application of these theorems, a new algebraic d ecoding algorithm for the (73, 37, 13) binary QR code is presented.