Abstract: This paper studied the coding algorithms for the R-S UEP Codes based on the algebraic characteristics of the code space. It formed the unequal distances of the information digits by separating the minimum ideal when coding. And when decoding, if the quantity of the errors in a received codeword was less than or equal to the minimum error protection capability, the general decoding algorithm was used, otherwise the decoder supposed the information digits whose error protection capabilities were high and verified the hypothesis by the code spaces whose error protection capabilities were low. By this means those important information could be found. Simulation showed that this algorithm was effective for the R-S UEP Code, and it provided more error protection capabilities for the important information.

Key words: error-correcting code, R-S UEP code, decoding algorithm

摘要： 本文以R-S不等保护码为研究对象，在分析码空间特性的基础上，着重研究编译码算法。编码时，利用分离最小理想的方法构造出信息元距离的不均匀性。译码时，如果接收码字中错误码元的数目小于或等于码空间的最低保护能力，则利用一般译码算法译码；否则对高保护等级信息元的值进行假设，并利用低保护等级的子空间验证该假设，用试探法找到满足验证条件的高保护等级信息元的值。仿真显示，该编译码算法对R-S不等保护码是有效的，它可以在不改变编码效率的前提下为高保护等级的信息元提供更好的误码性能。

关键词: 纠错码, R-S不等保护码, 译码算法