COMPLEXITY OF DECODING REED-SOLOMON CODES

被引:51
作者
JUSTESEN, J [1 ]
机构
[1] AALBORG UNIV CTR,AALBORG,DENMARK
关键词
D O I
10.1109/TIT.1976.1055516
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:237 / 238
页数:2
相关论文
共 5 条
[1]  
AFANASYEV VB, 1973, 3RD INT S INF THEOR
[2]   FAST CONVOLUTION USING FERMAT NUMBER TRANSFORMS WITH APPLICATIONS TO DIGITAL FILTERING [J].
AGARWAL, RC ;
BURRUS, CS .
IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1974, SP22 (02) :87-97
[3]  
AHO AV, 1974, DESIGN ANALYSIS COMP
[4]  
BERLEKAMP ER, 1968, ALGEBRAIC CODING THE
[5]   METHOD FOR SOLVING KEY EQUATION FOR DECODING GOPPA CODES [J].
SUGIYAMA, Y ;
KASAHARA, M ;
HIRASAWA, S ;
NAMEKAWA, T .
INFORMATION AND CONTROL, 1975, 27 (01) :87-99