Suchergebnisse - decoding ((algorithm OR Algorithms) OR (algorithmics OR algorithmics))

  1. 81

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

    Veröffentlicht 2023
    Inhaltsangabe: “… that for any decoder (streaming algorithm) $A$ that on input $x$ computes $f(x)$ in space …”
    Volltext
    Preprint
  2. 82

    Permutation decoding of first-order Generalized Reed-Muller codes von Bernal, José Joaquín, Simón, Juan Jacobo

    Veröffentlicht 2025
    Inhaltsangabe: “… In [4] we describe a variation of the classical permutation decoding algorithm that can be applied …”
    Volltext
    Preprint
  3. 83

    Generalized LDPC codes with low-complexity decoding and fast convergence von Simegn, Dawit, Artemasov, Dmitry, Andreev, Kirill, Rybin, Pavel, Frolov, Alexey

    Veröffentlicht 2025
    Inhaltsangabe: “… of Cordaro-Wagner codes. Two efficient decoding algorithms are proposed: one based on Hartmann-Rudolph …”
    Volltext
    Preprint
  4. 84

    Fractional decoding of algebraic geometry codes over extension fields von Camps-Moreno, Eduardo, Matthews, Gretchen L., Santos, Welington

    Veröffentlicht 2024
    Inhaltsangabe: “… projections to provide fractional decoding algorithms for the codes over $\mathbb{F}_{q^\ell}$. Fractional …”
    Volltext
    Preprint
  5. 85

    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
  6. 86

    Tight inapproximability of max-LINSAT and implications for decoded quantum interferometry von Kramer, Maximilian J., Schubert, Carsten, Eisert, Jens

    Veröffentlicht 2026
    Inhaltsangabe: “… . Specifically, we prove by a direct reduction from Håstad's theorem that no polynomial-time algorithm can exceed …”
    Volltext
    Preprint
  7. 87

    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. 88

    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
  9. 89

    Approximate maximum likelihood decoding with $K$ minimum weight matchings von Lin, Mao

    Veröffentlicht 2025
    Inhaltsangabe: “… more computationally expensive compared to the MWM decoder. In this work, we introduce an algorithm …”
    Volltext
    Preprint
  10. 90

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

    Veröffentlicht 2024
    Inhaltsangabe: “… . Recent work has seen tremendous progress in speeding up partitioning algorithms through parallelism …”
    Volltext
    Preprint
  11. 91

    A blindness property of the Min-Sum decoding for the toric code von Crest, Julien du, Mhalla, Mehdi, Savin, Valentin

    Veröffentlicht 2024
    Inhaltsangabe: “… message-passing decoding, a class of low-complexity, iterative decoding algorithms that play a central …”
    Volltext
    Preprint
  12. 92

    Quasi-twisted codes: decoding and applications in code-based cryptography von S, Bhagyalekshmy, Kshirsagar, Rutuja

    Veröffentlicht 2025
    Inhaltsangabe: “… no efficient decoding algorithm for QT codes. In this work, we propose a syndrome-based decoding method capable …”
    Volltext
    Preprint
  13. 93

    Low-weight quantum syndrome errors in belief propagation decoding von Landa, Haggai

    Veröffentlicht 2026
    Inhaltsangabe: “… We describe an empirical approach to identify low-weight combinations of columns of the decoding …”
    Volltext
    Preprint
  14. 94

    Scalable decoding protocols for fast transversal logic in the surface code von Turner, Mark L., Campbell, Earl T., Crawford, Ophelia, Gillespie, Neil I., Camps, Joan

    Veröffentlicht 2025
    Inhaltsangabe: “… by reducing the number of syndrome extraction rounds required, but current decoders for fast transversal logic …”
    Volltext
    Preprint
  15. 95

    Ambiguity Clustering: an accurate and efficient decoder for qLDPC codes von Wolanski, Stasiu, Barber, Ben

    Veröffentlicht 2024
    Inhaltsangabe: “… of its physical qubits. Key to any scheme of error correction is the decoding algorithm, which estimates …”
    Volltext
    Preprint
  16. 96

    Simplified circuit-level decoding using Knill error correction von Murphy, Ewan, Sahu, Subhayan, Vasmer, Michael

    Veröffentlicht 2026
    Inhaltsangabe: “… error-correcting code must be supplemented with a fast and accurate classical decoding algorithm …”
    Volltext
    Preprint
  17. 97

    Fast and accurate AI-based pre-decoders for surface codes von Chamberland, Christopher, Olle, Jan, Li, Muyuan, Thornton, Scott, Baratta, Igor

    Veröffentlicht 2026
    Inhaltsangabe: “… . This modular architecture is backend-agnostic and composes with arbitrary global decoding algorithms designed …”
    Volltext
    Preprint
  18. 98

    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
  19. 99

    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
  20. 100

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

    Veröffentlicht 2025
    Inhaltsangabe: “… We give a polynomial-time algorithm that finds a planted clique of size $k \ge \sqrt{n \log n …”
    Volltext
    Preprint