DocumentCode :
1134156
Title :
Algebraic decoding of the Zetterberg codes
Author :
Dodunekov, Stefan M. ; Nilsson, Jan E M
Author_Institution :
Inst. of Math., Bulgarian Acad. of Sci., Sofia, Bulgaria
Volume :
38
Issue :
5
fYear :
1992
fDate :
9/1/1992 12:00:00 AM
Firstpage :
1570
Lastpage :
1573
Abstract :
The Zetterberg codes are one of the best known families of double-error correcting binary linear codes. Unfortunately, no satisfactory decoding algorithm has been known for them until recently when an algebraic decoding algorithm was described by P. Kallquist (1989). It requires, however, to solve a quadratic equation in order to decide whether 2 or 3 errors have occurred. A simple criterion is derived to determine whether 1, 2, or 3 errors have occurred when a Zetterberg code is used for data transmission. Based on criterion a new decoding algorithm is proposed which is faster than the known one
Keywords :
decoding; error correction codes; Zetterberg codes; algebraic decoding algorithm; data transmission; double-error correcting binary linear codes; Calculus; Data communication; Decoding; Equations; Fractals; Information theory; Linear code; Mathematics; Probability; Quantum mechanics;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.149509
Filename :
149509
Link To Document :
بازگشت