作　　者： ; ;

机构地区： 西安电子科技大学

出　　处： 《电子科学学刊》 1995年第5期492-499,共8页

摘　　要： 设C是亏格为譬的不可约代数曲线;C(D,G)为C上的代数几何码,该码的设计距离为d=deg(G)—2g+2。本文首先从理论上证明所给算法的合理性,然后给出一种基于基本累次算法(FIA)的译码算法。该算法是G。L。Feng等人(1993)提出的算法的改进。它可对≤[(d—1)/2]个错误的接收向量进行译码。运算量与存贮量约为G。L。Feng等人算法的一半,且便于软硬件实现。 Supposing C is an irreducible algebraic curve of genus g, C*(D, G) is an algebraic geometric code of designed minimum distance d* = degG- 2g + 2. This paper, first, proves that the given algorithm is reasonable theoretically, then gives a decoding algorithm based on Fundamental Iterative Algorithm (FIA), which is a modification of the algorithm proposed by G. L. Feng, et al. (1993) and can correct any received code of (d* -1)/2 or less errors with complexity only one half of that of the algorithm proposed by G. L. Feng, et al. The procedure can be implemented easily by hardware or software.

关 键 词： 代数几何码 基本累次算法 译码算法 编码学

领　　域： [电子电信] [电子电信]