Improvement of binary and non binary statistical decoding algorithm

DOI10.1007/978-3-030-40921-0_12zbMATH Open1468.94455OpenAlexW3006333717MaRDI QIDQ776360FDOQ776360

Authors: Pierre-Louis Cayrel, Junaid Ahmad Khan, Jean Belo Klamti, Edoardo Persichetti, Cheikh T. Gueye 

Publication date: 8 July 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-40921-0_12

Recommendations

• Statistical Decoding Revisited
• A Statistical Decoding Algorithm for General Linear Block Codes
• Analysis of information set decoding for a sub-linear error weight
• Information-set decoding for linear codes over \(\mathbb F_q\)
• Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)

zbMATH Keywords

code-based cryptographylinear block codebase listMcEliece systemMO-fusionstatistical decoding

Mathematics Subject Classification ID

Cryptography (94A60) Linear codes (general theory) (94B05) Decoding (94B35)

Cited In (4)

• Generalization of BJMM-ISD using May-Ozerov nearest neighbor algorithm over an arbitrary finite field \(\mathbb{F}_q\)
• Some cryptanalytic and coding-theoretic applications of a soft Stern algorithm
• A Statistical Decoding Algorithm for General Linear Block Codes
• Statistical Decoding Revisited

This page was built for publication: Improvement of binary and non binary statistical decoding algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q776360)