Search Results - sub-linear decoding complexity

Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion

Authors: Ngo, Hung Q. Porat, Ely Rudra, Atri et al.

Contributors: Ngo, Hung Q. Porat, Ely Rudra, Atri 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]

Subject Geographic: Paris, France

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

Availability: 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

Efficient Algorithms for Noisy Group Testing.

Authors: Cai, Sheng Jahangoshahi, Mohammad Bakshi, Mayank et al.

Source: IEEE Transactions on Information Theory; Apr2017, Vol. 63 Issue 4, p2113-2136, 24p

Subject Terms: GREEDY algorithms, ENCODING, DECODING algorithms, ERROR correction (Information theory), BIPARTITE graphs, RANDOM variables

Sub-linear Time Stochastic Threshold Group Testing via Sparse-Graph Codes

Authors: Amirhossein Reisizadeh Pedro Abdalla Ramtin Pedarsani

Source: 2018 IEEE Information Theory Workshop (ITW). :1-5

Subject Terms: 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 1. No poverty, 02 engineering and technology, 3. Good health

Improved Non-Adaptive Algorithms for Threshold Group Testing With a Gap.

Authors: Bui, Thach V. Cheraghchi, Mahdi Echizen, Isao

Source: IEEE Transactions on Information Theory; Nov2021, Vol. 67 Issue 11, p7180-7196, 17p

Subject Terms: DECODING algorithms, COMBINATORICS, TEST design

Hybrid Non-Binary Repeated Polar Codes.

Authors: Abbasi, Fariba Mahdavifar, Hessam Viterbo, Emanuele

Source: IEEE Transactions on Wireless Communications; Sep2022, Vol. 21 Issue 9, p7582-7594, 13p

FFAST: An Algorithm for Computing an Exactly $ k$ -Sparse DFT in $O( k\log k)$ Time.

Authors: Pawar, Sameer Ramchandran, Kannan

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

SAFFRON: A Fast, Efficient, and Robust Framework for Group Testing Based on Sparse-Graph Codes.

Authors: Lee, Kangwook Chandrasekher, Kabir Pedarsani, Ramtin 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

Sub-Linear Time Support Recovery for Compressed Sensing Using Sparse-Graph Codes.

Authors: Li, Xiao Yin, Dong Pawar, Sameer et al.

Source: IEEE Transactions on Information Theory; Oct2019, Vol. 65 Issue 10, p6580-6619, 40p

Subject Terms: ORTHOGONAL matching pursuit, COMPRESSED sensing, DECODING algorithms, SPARSE matrices, TELECOMMUNICATION systems, ERROR probability, LENGTH measurement

Ligero: lightweight sublinear arguments without a trusted setup.

Authors: Ames, Scott Hazay, Carmit Ishai, Yuval 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

Local Proofs Approaching the Witness Length.

Authors: Ron-Zewi, Noga Rothblum, Ron

Source: Journal of the ACM; Jun2024, Vol. 71 Issue 3, p1-42, 42p

Subject Terms: CIRCUIT complexity, WITNESSES

REVISITING SPECTRAL BUNDLE METHODS: PRIMAL-DUAL (SUB)LINEAR CONVERGENCE RATES.

Authors: LIJUN DING GRIMMER, BENJAMIN

Source: SIAM Journal on Optimization; 2023, Vol. 33 Issue 2, p1305-1332, 28p

Subject Terms: COMPUTATIONAL complexity, EIGENVALUES

Improved Information Set Decoding Algorithms over Galois Ring in the Lee Metric.

Authors: Li, Yu Wang, Li-Ping

Source: Journal of Systems Science & Complexity; Jun2023, Vol. 36 Issue 3, p1319-1335, 17p

Integer syndrome decoding in the presence of noise.

Authors: Drăgoi, Vlad-Florin Colombier, Brice Cayrel, Pierre-Louis et al.

Source: Cryptography & Communications; Sep2024, Vol. 16 Issue 5, p1103-1134, 32p

Nearly Optimal Pseudorandomness from Hardness.

Authors: DORON, DEAN MOSHKOVITZ, DANA OH, JUSTIN et al.

Source: Journal of the ACM; Nov2022, Vol. 69 Issue 6, p1-55, 55p

Subject Terms: DETERMINISTIC algorithms, CIRCUIT complexity, SEED size

Analysis of Information Set Decoding for a Sub-linear Error Weight.

Authors: Canto Torres, Rodolfo Sendrier, Nicolas

Source: Post-Quantum Cryptography: 7th International Workshop, PQCrypto 2016, Fukuoka, Japan, February 24-26, 2016, Proceedings; 2016, p144-161, 18p

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes.

Authors: GURUSWAMI, VENKATESAN CHAOPING XING

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

Sub-linear time compressed sensing for support recovery using left and right regular sparse-graph codes.

Authors: Vem, Avinash Janakiraman, Nagaraj Thenkarai Narayanan, Krishna

Source: 2016 IEEE Information Theory Workshop (ITW); 2016, p429-433, 5p

Sparse-MoE-SAM: A Lightweight Framework Integrating MoE and SAM with a Sparse Attention Mechanism for Plant Disease Segmentation in Resource-Constrained Environments.

Authors: Zhao, Benhan Kang, Xilin Zhou, Hao et al.

Source: Plants (2223-7747); Sep2025, Vol. 14 Issue 17, p2634, 39p

Subject Terms: PLANT diseases, DEEP learning, MATHEMATICAL optimization, ARTIFICIAL intelligence

Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature.

Authors: Feneuil, Thibauld Joux, Antoine Rivain, Matthieu

Source: Designs, Codes & Cryptography; Feb2023, Vol. 91 Issue 2, p563-608, 46p

Subject Terms: LINEAR codes, QUANTUM cryptography, QUANTUM computers, PERMUTATIONS, CRYPTOGRAPHY, SYNDROMES, TRUST

Proof Complexity and Beyond.

Source: Oberwolfach Reports; 2024, Vol. 21 Issue 1, p871-934, 63p

Subject Terms: LINEAR programming, SEMIDEFINITE programming, COMPUTER science, COMBINATORICS, ALGORITHMS