DocumentCode
1184877
Title
Decoding the (73, 37, 13) quadratic residue code
Author
Chen, X. ; Reed, I.S. ; Truong, T.K.
Author_Institution
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA
Volume
141
Issue
5
fYear
1994
fDate
9/1/1994 12:00:00 AM
Firstpage
253
Lastpage
258
Abstract
Algebraic approaches to the decoding of the quadratic residue (QR) codes were studied recently. In Reed et. al. (1992), a decoding algorithm was given for the (41, 21, 9) binary QR code. Here, some new more general properties are found for the syndromes of the subclass of binary QR codes of length n = 8m +1. Using these properties, the new theorems needed to decode this subclass of the QR codes are obtained and proved. As an example of the application of these theorems, a new algebraic decoding algorithm for the (73, 37, 13) binary QR code is presented
Keywords
codes; decoding; binary QR codes; decoding; quadratic residue code; theorems;
fLanguage
English
Journal_Title
Computers and Digital Techniques, IEE Proceedings -
Publisher
iet
ISSN
1350-2387
Type
jour
DOI
10.1049/ip-cdt:19941294
Filename
326788
Link To Document