By Topic

On the performance of the ternary [13, 7, 5] quadratic-residue code

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Baicheva, T. ; Inst. of Math. & Inf., Bulgarian Acad. of Sci., Sofia, Bulgaria ; Dodunekov, S. ; Koetter, R.

We investigate the weight structure and error-correcting performance of the ternary [13, 7, 5] quadratic-residue code. It is shown that the covering radius of the code is equal to three and it is t-proper for error correction for any t=0, 1, 2. Two decoding algorithms are suggested

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 2 )