Probabilistic verification algorithm for linear codes
Abstract
In this paper, we propose a probabilistic algorithm suitable for any linear code C to determine whether a given vector x belongs to C. The algorithm achieves O(n n) time complexity, O(n2) space complexity and with an error probability less than 1/poly(n) in the asymptotic sense.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.