Solving LPN using covering codes (Q2303453)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7176803
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving LPN using covering codes |
scientific article; zbMATH DE number 7176803 |
Statements
Solving LPN using covering codes (English)
0 references
3 March 2020
0 references
learning from parity with noise problem (LPN)
0 references
BKW
0 references
covering codes
0 references
LPN-C
0 references
HB
0 references
Lapin
0 references
0 references
0.9943847060203552
0 references
0.9093448519706726
0 references
0.8796349167823792
0 references
0.8348610401153564
0 references
