MathDB2 problems
- 0 votes0 replies0 views
Polynomial-complexity conjecture for Gröbner-basis recovery of alternant codes
Consider the Gröbner-basis approach for recovering the polynomial structure, namely the support and multiplier, of an alternant code. Polynomial-complexity conjecture. The Gröbner-…
- 0 votes0 replies0 views
Random alternant-code filtration conjecture
Random alternant-code filtration conjecture. We expect that