Post-Quantum Cryptography

Volume 7071 of the series Lecture Notes in Computer Science pp 217-227

Statistical Decoding of Codes over \(\mathbb{F}_q\)

  • Robert NiebuhrAffiliated withFachbereich Informatik Kryptographie und Computeralgebra, Technische Universität Darmstadt

* Final gross prices may vary according to local VAT.

Get Access


In this paper we analyze statistical decoding over a finite field \(\mathbb{F}_q\). We generalize Overbeck’s binary statistical decoding algorithm to codes over \(\mathbb{F}_q\), and analyze the success probability of our algorithm. We provide experimental data for different field sizes. In addition to that, we describe two techniques how knowledge about structure of the code or of the solution can be used in order to speed up the decoding algorithm.


Statistical decoding general decoding code-based cryptography public-key cryptography