scientific article; zbMATH DE number 4123671
From MaRDI portal
Publication:4204104
zbMath0685.94007MaRDI QIDQ4204104
Publication date: 1989
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
decoding complexity of q-ary block-linear codesL-decoding algorithmmaximum-likelihood decoding algorithmq-ary symmetric memoryles channel
Related Items (4)
Information set decoding in the Lee metric with applications to cryptography ⋮ Generalization of the Ball-Collision Algorithm ⋮ On new problems in asymmetric cryptography based on error-resistant coding ⋮ Tables of coverings for decoding by S-sets
This page was built for publication: