3 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Morgan Barbier
The maximum-likelihood decoding problem is known to be NP-hard for general linear and Reed-Solomon codes. In this paper, we introduce the notion of A-covered codes, that is, codes…