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 · parameterized alphabet
Fix q, R=k/n, τ=t/n and bit-vs-field-operation model
Results
| # | PUBLICATION / AUTHORS | DATE | TIME BOUND | SPACE BOUND | EVIDENCE |
|---|---|---|---|---|---|
| No checked result has been added for this comparison contract. | |||||
Comparison definition & assumptions
- Regime
- Fix q, R=k/n, τ=t/n and bit-vs-field-operation model
- Computation
- Classical
- Rigor
- Source asymptotic analysis
- Instances
- Random q-ary codes
- Cost scale
- Parameterized in q, R and τ
- Parameter
- q,R,τ
- Description
- Non-binary Hamming decoding references.
- Comparison rules
- Binary coefficients cannot be transferred to q≥3. Instantiate alphabet q, code rate and relative weight before assigning a scalar exponent. See Hirose2016 and Elbro–Santini2025; the latter distinguishes memory-less and meet-in-the-middle algorithms.
- Tags
- q-ary, Hamming metric, fixed alphabet