Efficiently decodable compressed sensing by list-recoverable codes and recursion (Q2904764)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficiently decodable compressed sensing by list-recoverable codes and recursion |
scientific article; zbMATH DE number 6070905
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently decodable compressed sensing by list-recoverable codes and recursion |
scientific article; zbMATH DE number 6070905 |
Statements
23 August 2012
0 references
compressed sensing
0 references
sub-linear time decoding
0 references
list-recoverable codes
0 references
Efficiently decodable compressed sensing by list-recoverable codes and recursion (English)
0 references
0.7882290482521057
0 references
0.7632507681846619
0 references
0.7584425806999207
0 references
0.7490750551223755
0 references
