By Topic

Linear dependence relations of nonrecurrent syndromes in decoding cyclic codes beyond their design distance

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Armand, M.A. ; Dept. of Electr. & Comput. Eng., Nat. Univ. of Singapore, Singapore ; Ong, S.H.

In 1994, Feng at. al. gave a procedure for decoding cyclic codes that is bounded by the minimum distance of a code. The significance of their work lies in the fact that conventional decoding procedures based on the classical key equation are design distance-bounded and so do not exploit the full error-correcting capability of a code. A crucial step in Feng's decoding procedure is the computation of unknown syndromes using linear dependence relations. We present some results that may be used to carry out this important task.

Published in:

Communication Systems, 2002. ICCS 2002. The 8th International Conference on  (Volume:1 )

Date of Conference:

25-28 Nov. 2002