Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Two decoding algorithms for linear codes

From MaRDI portal
Publication:920927
Jump to:navigation, search

zbMath0708.94017MaRDI QIDQ920927

I. I. Dumer

Publication date: 1989

Published in: Problems of Information Transmission (Search for Journal in Brave)


zbMATH Keywords

linear codesdecoding algorithms


Mathematics Subject Classification ID

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


Related Items (7)

Information set decoding in the Lee metric with applications to cryptography ⋮ Structural properties of self-dual monomial codes with application to code-based cryptography ⋮ Generalization of the Ball-Collision Algorithm ⋮ Improved information set decoding algorithms over Galois ring in the Lee metric ⋮ Statistical decoding 2.0: reducing decoding to LPN ⋮ Side channel information set decoding using iterative chunking. Plaintext recovery from the ``Classic McEliece hardware reference implementation ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes




This page was built for publication: Two decoding algorithms for linear codes

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:920927&oldid=12887214"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 18:21.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki