Suchergebnisse - decoding ((algorithmssics OR algorithmsssics) OR (Algorithms OR (Algorithms OR Algorithms)))

  1. 1

    Tight bounds for stream decodable error-correcting codes von Gupta, Meghal, Guruswami, Venkatesan, Singhal, Mihir

    Veröffentlicht 2024
    Inhaltsangabe: “… code to encode her message $x$ into a codeword. The receiver (Bob) decodes it correctly whenever …”
    Volltext
    Preprint
  2. 2

    Generalized matching decoders for 2D topological translationally-invariant codes von Tan, Shi Jie Samuel, Gill, Ian, Huang, Eric, Liu, Pengyu, Zhao, Chen, Dehghani, Hossein, Kubica, Aleksander, Zhou, Hengyun, Dua, Arpit

    Veröffentlicht 2026
    Inhaltsangabe: “… . For such codes to be practically relevant, their decoders must successfully correct the most likely errors while …”
    Volltext
    Preprint
  3. 3

    Where to Split and When to Charge: Optimal Route Construction from Customer Permutations in Electric Vehicle Routing von Uroić, Leon Stjepan, Đurasević, Marko

    Veröffentlicht 2026
    Inhaltsangabe: “… feasible vehicle routes: they must be decoded by choosing where to split the permutation into routes …”
    Volltext
    Preprint
  4. 4

    Error Correction for Message Streams von Gupta, Meghal, Zhang, Rachel Yun

    Veröffentlicht 2023
    Inhaltsangabe: “… where Bob is a low space decoder. More precisely, he receives Alice's encoding $\text{enc}(x)$ bit …”
    Volltext
    Preprint
  5. 5

    Towards Settling the Complexity of the Lettericity Problem von Grobler, Mario, Morawietz, Nils, Sacher, Silas Cato

    Veröffentlicht 2026
    Inhaltsangabe: “… $ such that there is a word $w_1 \dots w_{|V|} \in Σ^*$ and a decoder $\mathcal{D} \subseteq Σ^2$ with the property …”
    Volltext
    Preprint
  6. 6

    Semirandom Planted Clique and the Restricted Isometry Property von Błasiok, Jarosław, Buhai, Rares-Darius, Kothari, Pravesh K., Steurer, David

    Veröffentlicht 2024
    Inhaltsangabe: “… We give a simple, greedy $O(n^{ω+0.5})=O(n^{2.872})$-time algorithm to list-decode planted cliques …”
    Volltext
    Preprint
  7. 7

    Better space-time-robustness trade-offs for set reconciliation von Belazzougui, Djamal, Kucherov, Gregory, Walzer, Stefan

    Veröffentlicht 2024
    Inhaltsangabe: “… on error-correcting coding techniques and suffer from a large decoding time. Existing probabilistic …”
    Volltext
    Preprint
  8. 8

    HybHuff: Lossless Compression for Hypergraphs via Entropy-Guided Huffman-Bitwise Coordination von Zhao, Tianyu, Zhao, Dongfang, Guo, Luanzheng, Tallent, Nathan

    Veröffentlicht 2025
    Inhaltsangabe: “… rate by up to 2.3x with comparable decoding overhead. To assess practical utility, we integrate our …”
    Volltext
    Preprint
  9. 9

    First Order Stochastic Optimization with Oblivious Noise von Diakonikolas, Ilias, Karmalkar, Sushrut, Park, Jongho, Tzamos, Christos

    Veröffentlicht 2024
    Inhaltsangabe: “… of inliers $α$ is less than $1/2$. Our main result is an efficient list-decodable learner that recovers a …”
    Volltext
    Preprint
  10. 10

    DNF Learning via Locally Mixing Random Walks von Alman, Josh, Nadimpalli, Shivam, Patel, Shyamal, Servedio, Rocco A.

    Veröffentlicht 2025
    Inhaltsangabe: “… distribution over $\{0,1\}^n$. (1) We first give a quasi-polynomial time "list-decoding" algorithm …”
    Volltext
    Preprint
  11. 11

    Competitive Non-Clairvoyant KV-Cache Scheduling for LLM Inference von Feng, Yiding, Yang, Zonghan, Zhang, Yuhao

    Veröffentlicht 2026
    Inhaltsangabe: “… (KV) cache, where a job's memory footprint grows linearly with the number of decoded tokens …”
    Volltext
    Preprint
  12. 12

    Tera-Scale Multilevel Graph Partitioning von Salwasser, Daniel, Seemaier, Daniel, Gottesbüren, Lars, Sanders, Peter

    Veröffentlicht 2024
    Inhaltsangabe: “… neighborhood by on-the-fly decoding at speeds close to the uncompressed graph. Combining these optimizations …”
    Volltext
    Preprint
  13. 13

    Semirandom Planted Clique via 1-norm Isometry Property von Guruswami, Venkatesan, Wang, Hsin-Po

    Veröffentlicht 2025
    Inhaltsangabe: “… property. Inspired by Wootters's work on list decoding, we put forth and implement the $1$-norm analog …”
    Volltext
    Preprint
  14. 14

    Continuous Optimization for Decoding Errors von Srivastava, Shashank

    Veröffentlicht 2024
    Inhaltsangabe: “… to support decoding, which is the task of recovering a codeword from its noisy copy. List decoding is a …”
    Volltext
    Preprint
  15. 15

    Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes von Ashvinkumar, Vikrant, Habib, Mursalin, Srivastava, Shashank

    Veröffentlicht 2025
    Inhaltsangabe: “… decoding capacity. In this work, we give improved deterministic and randomized algorithms for list decoding …”
    Volltext
    Preprint
  16. 16

    Minimum-Weight Parity Factor Decoder for Quantum Error Correction von Wu, Yue, Li, Binghong, Chang, Kathleen, Puri, Shruti, Zhong, Lin

    Veröffentlicht 2025
    Inhaltsangabe: “… Fast and accurate quantum error correction (QEC) decoding is crucial for scalable fault-tolerant …”
    Volltext
    Preprint
  17. 17

    List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics von Peikert, Chris, Hostetler, Alexandra Veliche

    Veröffentlicht 2025
    Inhaltsangabe: “… on efficient error correction for these codes, like the celebrated Berlekamp--Welch unique decoder …”
    Volltext
    Preprint
  18. 18

    Unique Decoding of Reed-Solomon and Related Codes for Semi-Adversarial Errors von Brakensiek, Joshua, Chen, Yeyuan, Dhar, Manik, Zhang, Zihan

    Veröffentlicht 2025
    Inhaltsangabe: “… Motivated by recent developments in coding theory, particular in list-decoding, we introduce a new …”
    Volltext
    Preprint
  19. 19

    List Decoding Expander-Based Codes via Fast Approximation of Expanding CSPs: I von Jeronimo, Fernando Granha, Singh, Aman

    Veröffentlicht 2025
    Inhaltsangabe: “… We present near-linear time list decoding algorithms (in the block-length $n$) for expander-based …”
    Volltext
    Preprint
  20. 20

    Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding von Guruswami, Venkatesan, Wang, Hsin-Po

    Veröffentlicht 2023
    Inhaltsangabe: “… to test noise, (iv) $O(k \mathrm{poly}(\log n))$ decoding time, and (v) lack of mistakes. In this paper …”
    Volltext
    Preprint