:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhao, Yun-Bin, Sun, Zhong-Feng
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Information Theory
Accesso online:	https://arxiv.org/abs/2509.24558
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Dynamic Thresholding Algorithm with Memory for Linear Inverse Problems
di: Sun, Zhong-Feng, et al.
Pubblicazione: (2024)

Newton-Direction-Based ReLU-Thresholding Methods for Nonnegative Sparse Signal Recovery
di: Bian, Ning, et al.
Pubblicazione: (2026)

Compressed Newton-direction-based Thresholding Methods for Sparse Optimization Problems
di: Meng, Nan, et al.
Pubblicazione: (2025)

Concatenated Sum-Rank Codes
di: Lao, Huimin, et al.
Pubblicazione: (2026)

Sparse Signal Recovery From Quadratic Systems with Full-Rank Matrices
di: Wen, Jinming, et al.
Pubblicazione: (2025)

Analysis and Design of Serially Concatenated LDGM Codes
di: Kharel, Amrit, et al.
Pubblicazione: (2018)

Toward Quantum CSS-T Codes from Sparse Matrices
di: Camps-Moreno, Eduardo, et al.
Pubblicazione: (2024)

Stopping Set Analysis for Concatenated Polar Code Architectures
di: Zhu, Ziyuan, et al.
Pubblicazione: (2024)

Exact Error Exponents of Concatenated Codes for DNA Storage
di: Ling, Yan Hao, et al.
Pubblicazione: (2024)

On the Weight Distribution of Concatenated Code Ensemble Based on the Plotkin Construction
di: Ma, Xiao
Pubblicazione: (2025)

Design and Analysis of a Concatenated Code for Intersymbol Interference Wiretap Channels
di: Nouri, Aria, et al.
Pubblicazione: (2025)

Performance-Complexity-Latency Trade-offs of Concatenated RS-BCH Codes
di: Sukmadji, Alvin Y., et al.
Pubblicazione: (2024)

Performance-Complexity-Latency Trade-offs of Concatenated RS-SDBCH Codes
di: Sukmadji, Alvin Y., et al.
Pubblicazione: (2024)

Performance-Complexity-Latency Trade-offs of Concatenated RS-SDBCH Codes
di: Sukmadji, Alvin Y., et al.
Pubblicazione: (2024)

Solving Quadratic Systems with Full-Rank Matrices Using Sparse or Generative Priors
di: Chen, Junren, et al.
Pubblicazione: (2023)

A Deep Learning Based Decoder for Concatenated Coding over Deletion Channels
di: Kargı, E. Uras, et al.
Pubblicazione: (2024)

A Practical Concatenated Coding Scheme for Noisy Shuffling Channels with Coset-based Indexing
di: Haghighat, Javad, et al.
Pubblicazione: (2024)

Uncertainty Quantification of Spectral Estimator and MLE for Orthogonal Group Synchronization
di: Zhong, Ziliang Samuel, et al.
Pubblicazione: (2024)

Generalized Orthogonal Chirp Division Multiplexing in Doubly Selective Channels
di: Liu, Yun, et al.
Pubblicazione: (2024)

A Fast and Provable Algorithm for Sparse Phase Retrieval
di: Cai, Jian-Feng, et al.
Pubblicazione: (2023)

Transformer-Based Decoding in Concatenated Coding Schemes Under Synchronization Errors
di: Streit, Julian, et al.
Pubblicazione: (2025)

Construction of Self-Orthogonal Quasi-Cyclic Codes and Their Application to Quantum Error-Correcting Codes
di: Gao, Mengying, et al.
Pubblicazione: (2025)

Sparse Recovery for Overcomplete Frames: Sensing Matrices and Recovery Guarantees
di: Chen, Xuemei, et al.
Pubblicazione: (2024)

Sparse Orthogonal Matching Pursuit-based Parameter Estimation for Integrated Sensing and Communications
di: Duong, Ngoc-Son, et al.
Pubblicazione: (2025)

When Do Low-Rate Concatenated Codes Approach The Gilbert-Varshamov Bound?
di: Doron, Dean, et al.
Pubblicazione: (2024)

Concatenated Codes for Short-Molecule DNA Storage with Sequencing Channels of Positive Zero-Undetected-Error Capacity
di: Tamir, Ran, et al.
Pubblicazione: (2026)

Federated PCA and Estimation for Spiked Covariance Matrices: Optimal Rates and Efficient Algorithm
di: Li, Jingyang, et al.
Pubblicazione: (2024)

Physical Layer Deception with Non-Orthogonal Multiplexing
di: Chen, Wenwen, et al.
Pubblicazione: (2024)

Rate Splitting Multiple Access: Optimal Beamforming Structure and Efficient Optimization Algorithms
di: Fang, Tianyu, et al.
Pubblicazione: (2024)

Alternating Maximization Algorithm for Mismatch Capacity with Oblivious Relaying
di: Li, Xinwei, et al.
Pubblicazione: (2024)

SPLITZ: Certifiable Robustness via Split Lipschitz Randomized Smoothing
di: Zhong, Meiyu, et al.
Pubblicazione: (2024)

Typical Solutions of Multi-User Linearly-Decomposable Distributed Computing
di: Khalesi, Ali, et al.
Pubblicazione: (2025)

Orthogonal Approximate Message Passing Algorithms for Rectangular Spiked Matrix Models with Rotationally Invariant Noise
di: Chen, Haohua, et al.
Pubblicazione: (2026)

Optimal Estimation in Orthogonally Invariant Generalized Linear Models: Spectral Initialization and Approximate Message Passing
di: Zhang, Yihan, et al.
Pubblicazione: (2026)

Low-Complexity Decoding for Low-Rate Block Codes of Short Length Based on Concatenated Coding Structure
di: Lin, Mao-Chao, et al.
Pubblicazione: (2025)

An Efficient Max-Min Fair Resource Optimization Algorithm for Rate-Splitting Multiple Access
di: Luo, Facheng, et al.
Pubblicazione: (2025)

Antenna Position and Beamforming Optimization for Movable Antenna Enabled ISAC: Optimal Solutions and Efficient Algorithms
di: Chen, Lebin, et al.
Pubblicazione: (2025)

New Solutions to Delsarte's Dual Linear Programs
di: Chailloux, André, et al.
Pubblicazione: (2024)

On A Class of Greedy Sparse Recovery Algorithms
di: Li, Gang, et al.
Pubblicazione: (2024)

Two-Stage Distributionally Robust Optimization Framework for Secure Communications in Aerial-RIS Systems
di: Feng, Zhongming, et al.
Pubblicazione: (2025)