Risultati della ricerca - decoding ((algorithm OR Algorithmssic) OR (algorithmics OR algorithmics))

Decoding Quantum Search Advantage: The Critical Role of State Properties in Random Walks di Zhou, Si-Qi, Liang, Jin-Min, Ding, Ziheng, Chen, Zhihua, Fei, Shao-Ming, Ma, Zhihao

Sommario: “...Quantum algorithms have demonstrated provable speedups over classical counterparts, yet...”
Testo

Low-Complexity PSCL Decoding of Polar Codes di Yao, Xinyuanmeng, Ma, Xiao

Sommario: “.... To reduce latency, a partitioned SCL (PSCL) decoding algorithm, implemented over a PSCL decoding tree, can...”
Testo

Novel Decoding Algorithm for Noiseless Non-Adaptive Group Testing di Franco-Vivo, Manuel

Sommario: “... performing as few tests as possible. To this end, we first note current well-known decoding algorithms...”
Testo

Decoding Algebraic Geometry codes by a key equation di Farran, J. I.

Sommario: “... A new effective decoding algorithm is presented for arbitrary algebraic-geometric codes...”
Testo

Progressive-Proximity Bit-Flipping for Decoding Surface Codes di Pacenti, Michele, Flanagan, Mark F., Chytas, Dimitris, Vasic, Bane

Sommario: “... operations on dynamic memories, as do state-of-art decoding algorithms such as minimum weight perfect...”
Testo

Continuous Optimization for Decoding Errors di Srivastava, Shashank

Sommario: “... the last 25 years. In this thesis, we prove new algorithmic and combinatorial results about list decoding...”
Testo

Non-Asymptotic Achievable Rate-Distortion Region for Indirect Wyner-Ziv Source Coding di Wei, Jiahui, Mary, Philippe, Dupraz, Elsa

Sommario: “...In the Wyner-Ziv source coding problem, a source $X$ has to be encoded while the decoder has access...”
Testo

Achievable Rates of Nanopore-based DNA Storage di McBain, Brendon, Viterbo, Emanuele

Sommario: “... algorithms are derived for efficient soft decoding of nanopore signals using NNC-Scrappie. Previously...”
Testo

Successive-Cancellation Flip Decoding of Polar Codes Under Fixed Channel-Production Rate di Sagitov, Ilshat, Pillet, Charles, Giard, Pascal

Sommario: “... channels under the low-complexity successive-cancellation flip (SCF) decoding algorithm. However, the SCF...”
Testo

Fairness Optimization for Intelligent Reflecting Surface Aided Uplink Rate-Splitting Multiple Access di Zhang, Shanshan, Chen, Wen, Wu, Qingqing, Liu, Ziwei, Zhang, Shunqing, Li, Jun

Sommario: “... optimization problem. To solve the optimization problem, we adopt an alternative optimization (AO) algorithm...”
Testo

An Optimal Sequence Reconstruction Algorithm for Reed-Solomon Codes di Singhvi, Shubhransh, Con, Roni, Kiah, Han Mao, Yaakobi, Eitan

Sommario: “... soft-decoding algorithm, presenting a reconstruction algorithm capable of correcting beyond Johnson...”
Testo

Two-timescale weighted sum-rate maximization for large cellular and cell-free massive MIMO di Miretti, Lorenzo, Björnson, Emil, Stańczak, Sławomir

Sommario: “...-term methods, where an iterative algorithm is run for every instantaneous channel realization, we...”
Testo

Symbolic Hamburger-Noether expressions of plane curves and construction of AG codes di Campillo, A., Farran, J. I.

Sommario: “... We present an algorithm to compute bases for the spaces L(G), provided G is a rational divisor...”
Testo

Construction and Fast Decoding of Binary Linear Sum-Rank-Metric Codes di Chen, Hao, Qi, Yanfeng, Cheng, Zhiqiang

Sommario: “... of the decoding in the sum-rank-metric to the decoding in the Hamming metric is given. Fast decoding algorithms...”
Testo

The Quantum Decoding Problem : Tight Achievability Bounds and Application to Regev's Reduction di Blanvillain, Agathe, Chailloux, André, Tillich, Jean-Pierre

Sommario: “... for the quantum decoding problem together with Regev's reduction, we derive a quantum algorithm sampling codewords...”
Testo

Accelerating Transformer Inference for Translation via Parallel Decoding di Santilli, Andrea, Severino, Silvio, Postolache, Emilian, Maiorca, Valentino, Mancusi, Michele, Marin, Riccardo, Rodolà, Emanuele

Sommario: “... quality. In this paper, we propose to address the problem from the point of view of decoding algorithms...”
Testo

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

Sommario: “...We give a simple, greedy $O(n^{ω+0.5})=O(n^{2.872})$-time algorithm to list-decode planted cliques...”
Testo

Information compression via hidden subgroup quantum autoencoders di Liu, Feiyang, Bian, Kaiming, Meng, Fei, Zhang, Wen, Dahlsten, Oscar

Sommario: “..., from which the input data can be recovered by the decoder. In illustrative examples, our algorithm...”
Testo

Streaming Looking Ahead with Token-level Self-reward di Zhang, Hongming, Hong, Ruixin, Yu, Dong

Sommario: “...Autoregressive decoding algorithms that use only past information often cannot guarantee the best...”
Testo

Challenges and Solutions in Selecting Optimal Lossless Data Compression Algorithms di Rahman, Md. Atiqur, Rabbi, MM Fazle

Sommario: “... methods. However, existing algorithms exhibit trade-offs: some achieve high compression ratios, others...”
Testo