CryptoRecords.info
q-SD

Decoding random q-ary codes

Hamming-metric syndrome decoding over a specified finite field. Alphabet, rate, error weight and cost unit must be fixed.

Classical · polynomial memory

Fix q, R and τ; polynomial workspace

0 results · 0 papers
ClassicalSource asymptotic analysisRandom q-ary codesParameterized in q, R and τ
Results
Compare historyJSONCSV
#PUBLICATION / AUTHORSDATETIME BOUNDSPACE BOUNDEVIDENCE
No checked result has been added for this comparison contract.
0 of 0 entriesIncludes relevant non-record results. Dates refer to the specific bound.
Comparison definition & assumptions
Regime
Fix q, R and τ; polynomial workspace
Computation
Classical
Rigor
Source asymptotic analysis
Instances
Random q-ary codes
Cost scale
Parameterized in q, R and τ
Parameter
q,R,τ
Description
Polynomial-space non-binary ISD.
Comparison rules
The 2025 Elbro–Santini source identifies a memory-less algorithm. A cost point requires a specified field and error regime; no universal binary coefficient is inserted.
Tags
q-ary, polynomial memory