Decoding random q-ary codes
Hamming-metric syndrome decoding over a specified finite field. Alphabet, rate, error weight and cost unit must be fixed.
2 variants · 0 entries. Compare bounds only within the same variant.
COMPARISON VARIANTREGIME / INSTANCEENTRIESBEST c
q-SDClassical · parameterized alphabetClassical · Source asymptotic analysisFix q, R=k/n, τ=t/n and bit-vs-field-operation modelRandom q-ary codes0— q-SDClassical · polynomial memoryClassical · Source asymptotic analysisFix q, R and τ; polynomial workspaceRandom q-ary codes0—