Unique and Minimum Distance Decoding of Linear Codes with Reduced Complexity
Abstract
We show that for (systematic) linear codes the time complexity of unique decoding is O(n2qnRH(delta/2/R)) and the time complexity of minimum distance decoding is O(n2qnRH(delta/R)). The proposed algorithm inspects all error patterns in the information set of the received message of weight less than d/2 or d, respectively.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.