most citedComplexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes

2 citations · 4 across the 2 of their papers we have counts for

collaborators

8 papers

cs.IT20082 cited

Constant-Rank Codes

Maximilien Gadouleau, Zhiyuan Yan

Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random network coding. In this paper, we show that constant-rank…

cs.IT20082 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.IT20073 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…

cs.IT2007

MacWilliams Identity for Codes with the Rank Metric

Maximilien Gadouleau, Zhiyuan Yan

The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In…

cs.IT20073 cited

Properties of Rank Metric Codes

Maximilien Gadouleau, Zhiyuan Yan

This paper investigates general properties of codes with the rank metric. We first investigate asymptotic packing properties of rank metric codes. Then, we study sphere covering pr…

cs.IT20072 cited

MacWilliams Identity for the Rank Metric

Maximilien Gadouleau, Zhiyuan Yan

This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacW…