Search Results - sub-linear decoding complexity
-
1
Authors: et al.
Contributors: et al.
Source: Symposium on Theoretical Aspects of Computer Science ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science) ; https://hal.archives-ouvertes.fr/hal-00678171 ; STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Feb 2012, Paris, France. pp.230-241
Subject Terms: Compressed Sensing, Sub-Linear Time Decoding, List-Recoverable Codes, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
Relation: hal-00678171; https://hal.archives-ouvertes.fr/hal-00678171; https://hal.archives-ouvertes.fr/hal-00678171/document; https://hal.archives-ouvertes.fr/hal-00678171/file/17.pdf
-
2
Authors: et al.
Source: IEEE Transactions on Information Theory; Apr2017, Vol. 63 Issue 4, p2113-2136, 24p
-
3
Authors:
Source: 2018 IEEE Information Theory Workshop (ITW). :1-5
-
4
Authors:
Source: IEEE Transactions on Information Theory; Nov2021, Vol. 67 Issue 11, p7180-7196, 17p
Subject Terms: DECODING algorithms, COMBINATORICS, TEST design
-
5
Authors:
Source: IEEE Transactions on Wireless Communications; Sep2022, Vol. 21 Issue 9, p7582-7594, 13p
-
6
Authors:
Source: IEEE Transactions on Information Theory; Jan2018, Vol. 64 Issue 1, p429-450, 22p
Subject Terms: DISCRETE Fourier transforms, SIGNAL processing, ALGORITHMS, GRAPH algorithms, SPARSE graphs
-
7
Authors: et al.
Source: IEEE Transactions on Signal Processing. 9/1/2019, Vol. 67 Issue 17, p4649-4664. 16p.
Subject Terms: *CODING theory, *SAFFRON crocus, *CIPHERS, *NOISE measurement
-
8
Authors: et al.
Source: IEEE Transactions on Information Theory; Oct2019, Vol. 65 Issue 10, p6580-6619, 40p
-
9
Authors: et al.
Source: Designs, Codes & Cryptography; Nov2023, Vol. 91 Issue 11, p3379-3424, 46p
Subject Terms: TRUST, CIRCUIT complexity, REED-Solomon codes, ARGUMENT, CRYPTOCURRENCIES, DECODING algorithms
-
10
Authors:
Source: Journal of the ACM; Jun2024, Vol. 71 Issue 3, p1-42, 42p
Subject Terms: CIRCUIT complexity, WITNESSES
-
11
Authors:
Source: SIAM Journal on Optimization; 2023, Vol. 33 Issue 2, p1305-1332, 28p
Subject Terms: COMPUTATIONAL complexity, EIGENVALUES
-
12
Authors:
Source: Journal of Systems Science & Complexity; Jun2023, Vol. 36 Issue 3, p1319-1335, 17p
-
13
Authors: et al.
Source: Cryptography & Communications; Sep2024, Vol. 16 Issue 5, p1103-1134, 32p
-
14
Authors: et al.
Source: Journal of the ACM; Nov2022, Vol. 69 Issue 6, p1-55, 55p
Subject Terms: DETERMINISTIC algorithms, CIRCUIT complexity, SEED size
-
15
Authors:
Source: Post-Quantum Cryptography: 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings; 2016, p144-161, 18p
-
16
Authors:
Source: Journal of the ACM; Mar2022, Vol. 69 Issue 2, p1-48, 48p
Subject Terms: ALGEBRAIC codes, DECODING algorithms, BLOCK codes, DETERMINISTIC algorithms, REED-Solomon codes
-
17
Authors:
Source: 2016 IEEE Information Theory Workshop (ITW); 2016, p429-433, 5p
-
18
Authors: et al.
Source: Plants (2223-7747); Sep2025, Vol. 14 Issue 17, p2634, 39p
Subject Terms: PLANT diseases, DEEP learning, MATHEMATICAL optimization, ARTIFICIAL intelligence
-
19
Authors:
Source: Designs, Codes & Cryptography; Feb2023, Vol. 91 Issue 2, p563-608, 46p
Subject Terms: LINEAR codes, QUANTUM cryptography, QUANTUM computers, PERMUTATIONS, CRYPTOGRAPHY, SYNDROMES, TRUST
-
20
Source: Oberwolfach Reports; 2024, Vol. 21 Issue 1, p871-934, 63p
Subject Terms: LINEAR programming, SEMIDEFINITE programming, COMPUTER science, COMBINATORICS, ALGORITHMS
Nájsť tento článok vo Web of Science
Full Text Finder