摘要
本文给出了基于矩阵分解的代数几何码的译码算法，该算法可对任意错误个数不超过［（ｄ－１）／２］的接收码字进行译码，且该算法简单，便于理解与实现。
A decoding algorithm for algebraic geometric codes based on matrix factorizations is presented,which is capable of correcting any received words with errors not more than [(d-1)/2].The algorithm is very simple and easy to understand.
出处
《通信学报》
EI
CSCD
北大核心
1996年第2期27-38,共12页
Journal on Communications
关键词
代数几何码
矩阵分解
译码
algebraic geometric code,matrix factorization,decoding,designed distance
