3 citations · 5 across the 2 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2008★ 2 cited
Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes
Ning Chen, Zhiyuan Yan
For the majority of the applications of Reed-Solomon (RS) codes, hard decision decoding is based on syndromes. Recently, there has been renewed interest in decoding RS codes withou…
cs.IT2007★ 3 cited
Cyclotomic FFTs with Reduced Additive Complexities Based on a Novel Common Subexpression Elimination Algorithm
Ning Chen, Zhiyuan Yan
In this paper, we first propose a novel common subexpression elimination (CSE) algorithm for matrix-vector multiplications over characteristic-2 fields. As opposed to previously pr…