Suchergebnisse - decoding (algorithmsssic OR (Algorithms OR algorithmsssic))

  1. 41

    Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets von Alrabiah, Omar, Guo, Zeyu, Guruswami, Venkatesan, Li, Ray, Zhang, Zihan

    Veröffentlicht 2023
    Inhaltsangabe: “… for their optimal unique-decoding capabilities, but their list-decoding capabilities are not fully understood. Given …”
    Volltext
    Preprint
  2. 42

    Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets von Guo, Zeyu, Zhang, Zihan

    Veröffentlicht 2023
    Inhaltsangabe: “… of polynomial size achieve the list decoding capacity. More specifically, we prove that for any $ε>0$ and $R …”
    Volltext
    Preprint
  3. 43

    Random Reed-Solomon Codes Achieve the Half-Singleton Bound for Insertions and Deletions over Linear-Sized Alphabets von Con, Roni, Guo, Zeyu, Li, Ray, Zhang, Zihan

    Veröffentlicht 2024
    Inhaltsangabe: “… works on list-decoding Reed-Solomon codes. Brakensiek-Gopi-Makam (STOC 2023) showed that random Reed …”
    Volltext
    Preprint
  4. 44

    On The MCMC Performance In Bernoulli Group Testing And The Random Max Set-Cover Problem von Lovig, Maxwell, Zadik, Ilias

    Veröffentlicht 2024
    Inhaltsangabe: “… , as there exists a decoder that can identify with high probability as $n$ grows the infected individuals using $m …”
    Volltext
    Preprint
  5. 45

    A General Framework for Low Soundness Homomorphism Testing von Mittal, Tushant, Roy, Sourya

    Veröffentlicht 2025
    Inhaltsangabe: “… -abelian groups. As an additional corollary, our framework gives combinatorial list decoding bounds …”
    Volltext
    Preprint
  6. 46

    Improved Decoding of Tanner Codes von Zhou, Zhaienhe, Guo, Zeyu

    Veröffentlicht 2025
    Inhaltsangabe: “… In this paper, we present improved decoding algorithms for expander-based Tanner codes. We begin …”
    Volltext
    Preprint
  7. 47

    Two for One, One for All: Deterministic LDC-based Robust Computation in Congested Clique von Censor-Hillel, Keren, Fischer, Orr, Gelles, Ran, Soto, Pedro

    Veröffentlicht 2025
    Inhaltsangabe: “… information across the network, where we leverage locally-decodable codes (LDCs) to maintain a low complexity …”
    Volltext
    Preprint
  8. 48

    Noisy Nonadaptive Group Testing with Binary Splitting: New Test Design and Improvement on Price-Scarlett-Tan's Scheme von Li, Xiaxin, Mazumdar, Arya

    Veröffentlicht 2024
    Inhaltsangabe: “… pools of items together and using the least amount of tests possible. Recently, a fast decoding method …”
    Volltext
    Preprint
  9. 49

    List Decoding Expander-Based Codes up to Capacity in Near-Linear Time von Srivastava, Shashank, Tulsiani, Madhur

    Veröffentlicht 2025
    Inhaltsangabe: “… We give a new framework based on graph regularity lemmas, for list decoding and list recovery …”
    Volltext
    Preprint
  10. 50

    List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering von Diakonikolas, Ilias, Kane, Daniel M., Karmalkar, Sushrut, Pensia, Ankit, Pittas, Thanasis

    Veröffentlicht 2022
    Inhaltsangabe: “… We study the problem of list-decodable sparse mean estimation. Specifically, for a parameter $α …”
    Volltext
    Preprint
  11. 51

    Support Recovery in One-bit Compressed Sensing with Near-Optimal Measurements and Sublinear Time von Li, Xiaxin, Mazumdar, Arya

    Veröffentlicht 2025
    Inhaltsangabe: “… methods minimize the number of measurements but often incur $Ω(n)$ decoding complexity, limiting large …”
    Volltext
    Preprint
  12. 52

    Compression with Privacy-Preserving Random Access von Chandar, Venkat, Tchamkerten, Aslan, Vatedka, Shashank

    Veröffentlicht 2025
    Inhaltsangabe: “… at any rate above entropy such that the individual decoding of any $X_i$ reveals \emph{no} information …”
    Volltext
    Preprint
  13. 53

    SubGen: Token Generation in Sublinear Time and Memory von Zandieh, Amir, Han, Insu, Mirrokni, Vahab, Karbasi, Amin

    Veröffentlicht 2024
    Inhaltsangabe: “… footprint of LLM decoders arises from the necessity to store all previous tokens in the attention module, a …”
    Volltext
    Preprint
  14. 54

    A Cryptosystem Based Upon Sums of Key Functions von Vyacheslav V. Kalashnikov

    Veröffentlicht 2017
    Inhaltsangabe: “… Nataliya I. Kalashnykova Vitaliy V. Kalashnikov Computación Cryptosystems Decoding Algorithms Derivative …”
    Volltext
    Artículo científico
  15. 55

    SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications von Diakonikolas, Ilias, Hopkins, Samuel B., Pensia, Ankit, Tiegel, Stefan

    Veröffentlicht 2024
    Inhaltsangabe: “… : robust mean estimation, list-decodable mean estimation, clustering mean-separated mixture models, robust …”
    Volltext
    Preprint
  16. 56

    Dynamic programming by polymorphic semiring algebraic shortcut fusion von Little, Max A., He, Xi, Kayas, Ugur

    Veröffentlicht 2021
    Inhaltsangabe: “… and Viterbi decoding, probabilistic marginalization, logical inference, fuzzy sets, differentiable softmax …”
    Volltext
    Preprint
  17. 57

    Entangled Mean Estimation in High-Dimensions von Diakonikolas, Ilias, Kane, Daniel M., Liu, Sihan, Pittas, Thanasis

    Veröffentlicht 2025
    Inhaltsangabe: “… dimension-reduction strategy, and employ a novel subroutine inspired by list-decodable learning …”
    Volltext
    Preprint
  18. 58

    All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free von Fischer, Orr, Parter, Merav

    Veröffentlicht 2025
    Inhaltsangabe: “… approach is based on a combination of techniques, including error-correcting-code, locally decodable codes …”
    Volltext
    Preprint
  19. 59

    Hardness of Maximum Likelihood Learning of DPPs von Grigorescu, Elena, Juba, Brendan, Wimmer, Karl, Xie, Ning

    Veröffentlicht 2022
    Inhaltsangabe: “… , we show that these continuous vectors can be decoded into a proper $3$-coloring after removing a …”
    Volltext
    Preprint
  20. 60

    Batch List-Decodable Linear Regression via Higher Moments von Diakonikolas, Ilias, Kane, Daniel M., Karmalkar, Sushrut, Liu, Sihan, Pittas, Thanasis

    Veröffentlicht 2025
    Inhaltsangabe: “… We study the task of list-decodable linear regression using batches. A batch is called clean …”
    Volltext
    Preprint