Copertina

Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Liu, Yuhao, Li, Xinwei, Pang, Shuqin, Wu, Hao, Zhang, Wenyi
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Information Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Generalized Nearest Neighbor Decoding: General Input Constellation and a Case Study of Interference Suppression
di: Pang, Shuqin, et al.
Pubblicazione: (2024)

Information Rates of Channels with Additive White Cauchy Noise
di: Pang, Shuqin, et al.
Pubblicazione: (2024)

A High-Resolution Analysis of Receiver Quantization in Communication
di: Zhou, Jing, et al.
Pubblicazione: (2025)

An Information-Theoretic Framework for Receiver Quantization in Communication
di: Zhou, Jing, et al.
Pubblicazione: (2025)

A Double Maximization Approach for Optimizing the LM Rate of Mismatched Decoding
di: Chen, Lingyi, et al.
Pubblicazione: (2024)

ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM
di: Li, Zhuang, et al.
Pubblicazione: (2024)

GRAND for Gaussian Intersymbol Interference Channels
di: Li, Zhuang, et al.
Pubblicazione: (2026)

Approaching Maximum Likelihood Decoding Performance via Reshuffling ORBGRAND
di: Wan, Li, et al.
Pubblicazione: (2024)

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

Fine-tuning ORBGRAND with Very Few Channel Soft Values
di: Wan, Li, et al.
Pubblicazione: (2025)

An Optimal Transport-Based Method for Computing LM Rate and Its Convergence Analysis
di: Wu, Shitong, et al.
Pubblicazione: (2025)

PAC Learnability for Reliable Communication over Discrete Memoryless Channels
di: Liu, Jiakun, et al.
Pubblicazione: (2024)

Minimax Optimal Algorithms with Fixed-$k$-Nearest Neighbors
di: Ryu, J. Jon, et al.
Pubblicazione: (2022)

Generalization Bounds for Transformer Channel Decoders
di: Zhang, Qinshan, et al.
Pubblicazione: (2026)

Capacity-Region-Achieving Sparse Regression Codes for MIMO Multiple-Access Channels
di: Yan, Hao, et al.
Pubblicazione: (2026)

Shapley-Based Data Valuation with Mutual Information: A Key to Modified K-Nearest Neighbors
di: Vahedifar, Mohammad Ali, et al.
Pubblicazione: (2023)

On Convergence of Discrete Schemes for Computing the Rate-Distortion Function of Continuous Source
di: Chen, Lingyi, et al.
Pubblicazione: (2024)

Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search
di: Severo, Daniel, et al.
Pubblicazione: (2025)

The Error Probability of Spatially Coupled Sparse Regression Codes over Memoryless Channels
di: Liu, Yuhao, et al.
Pubblicazione: (2024)

Reducing ORBGRAND Latency via Partial Gaussian Elimination
di: Wan, Li, et al.
Pubblicazione: (2026)

A Finite-Blocklength Analysis for ORBGRAND
di: Li, Zhuang, et al.
Pubblicazione: (2026)

ORBGRAND Is Exactly Capacity-achieving via Rank Companding
di: Li, Zhuang, et al.
Pubblicazione: (2025)

Variational Diffusion Channel Decoder
di: Zhang, Chengwei, et al.
Pubblicazione: (2026)

RDD Function: A Tradeoff Between Rate and Distortion-in-Distortion
di: Chen, Lingyi, et al.
Pubblicazione: (2025)

Efficient Computation of Marton's Error Exponent via Constraint Decoupling
di: Ye, Jiachuan, et al.
Pubblicazione: (2025)

Efficient and Provably Convergent Computation of Information Bottleneck: A Semi-Relaxed Approach
di: Chen, Lingyi, et al.
Pubblicazione: (2024)

An Expectation-Maximization Relaxed Method for Privacy Funnel
di: Chen, Lingyi, et al.
Pubblicazione: (2024)

Memory-Assisted Quantized LDPC Decoding
di: Mohr, Philipp, et al.
Pubblicazione: (2024)

From Bit to Block: Decoding on Erasure Channels
di: Pfister, Henry D., et al.
Pubblicazione: (2025)

On Secrecy Capacity of Binary Beampointing Channels with Block Memory and Feedback
di: Li, Siyao, et al.
Pubblicazione: (2025)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
di: Bruch, Sebastian, et al.
Pubblicazione: (2025)

Efficient and Effective Retrieval of Dense-Sparse Hybrid Vectors using Graph-based Approximate Nearest Neighbor Search
di: Zhang, Haoyu, et al.
Pubblicazione: (2024)

Random Modulation: Achieving Asymptotic Replica Optimality over Arbitrary Norm-Bounded and Spectrally Convergent Channel Matrices
di: Liu, Lei, et al.
Pubblicazione: (2025)

Sensing with Random Signals: The Role of Time Sharing
di: Geng, Yi, et al.
Pubblicazione: (2026)

A Remark on Downlink Massive Random Access
di: Liao, Yuchen, et al.
Pubblicazione: (2026)

A Parallelization Strategy for GRAND with Optimality Guarantee by Exploiting Error Pattern Tree Representation
di: Wan, Li, et al.
Pubblicazione: (2025)

On the Sensing Capacity of Gaussian "Beam-Pointing" Channels with Block Memory and Feedback
di: Li, Siyao, et al.
Pubblicazione: (2025)

An Efficient Alternating Minimization Algorithm for Computing Quantum Rate-Distortion Function
di: Chen, Lingyi, et al.
Pubblicazione: (2025)

On the Optimality of Decode and Forward for Some Cooperative Broadcast Channels
di: Gouic, Nicolas Le, et al.
Pubblicazione: (2026)

On The Decoding Error Weight of One or Two Deletion Channels
di: Sabary, Omer, et al.
Pubblicazione: (2022)