Imagen de Portada

ORBGRAND Is Exactly Capacity-achieving via Rank Companding

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Zhuang, Zhang, Wenyi
Formato:	Preprint
Publicado:	2025
Materias:	Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

Capacity-achieving sparse superposition codes with spatially coupled VAMP decoder
por: Liu, Yuhao, et al.
Publicado: (2025)

Finite Blocklength Performance of Capacity-achieving Codes in the Light of Complexity Theory
por: Boche, Holger, et al.
Publicado: (2024)

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

Random Gabidulin Codes Achieve List Decoding Capacity in the Rank Metric
por: Guo, Zeyu, et al.
Publicado: (2024)

Exact Outage Probability and Ergodic Capacity Analysis of NOMA in Rayleigh Fading Channels
por: Al-Dweik, Arafat, et al.
Publicado: (2026)

On The Capacity of Low-Rank Dyadic Fading Channels in the Low-SNR Regime
por: Singh, Kamal
Publicado: (2023)

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

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

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

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

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

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

Data-Driven Neural Estimation of Indirect Rate-Distortion Function
por: Yu, Zichao, et al.
Publicado: (2024)

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

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

Linear time encodable binary code achieving GV bound with linear time encodable dual achieving GV bound
por: Brehm, Martijn, et al.
Publicado: (2025)

Geometric constellation shaping for wireless optical intensity channels: An information-theoretic approach
por: Zhou, Suhua, et al.
Publicado: (2024)

Vectorized Generalized Nearest Neighbor Decoding for In-block Memory Channel
por: Liu, Yuhao, et al.
Publicado: (2026)

Learning-Based Interface for Semantic Communication with Bit Importance Awareness
por: Kong, Wenzheng, et al.
Publicado: (2025)

Capacity on BMS Channels via Code Symmetry and Nesting
por: Pfister, Henry D., et al.
Publicado: (2025)

Second-Order Identification Capacity of AWGN Channels
por: Liu, Zhicheng, et al.
Publicado: (2024)

New Algorithms for Computing Sibson Capacity and Arimoto Capacity
por: Kamatsuka, Akira, et al.
Publicado: (2024)

Binomial Channel: On the Capacity-Achieving Distribution and Bounds on the Capacity
por: Zieder, Ian, et al.
Publicado: (2024)

Average Secrecy Capacity Maximization of Rotatable Antenna-Assisted Secure Communications
por: Jiang, Pengchuan, et al.
Publicado: (2025)

A Rate-Distortion Analysis for Composite Sources Under Subsource-Dependent Fidelity Criteria
por: Liu, Jiakun, et al.
Publicado: (2024)

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

Capacity-Achieving Codes with Inverse-Ackermann-Depth Encoders
por: Li, Yuan
Publicado: (2025)

The Capacity of Collusion-Resilient Decentralized Secure Aggregation with Groupwise Keys
por: Li, Zhou, et al.
Publicado: (2025)

Graph-Theoretic Characterization of Noise Capacity of Conditional Disclosure of Secrets
por: Li, Zhou, et al.
Publicado: (2025)

$α$-leakage Interpretation of Rényi Capacity
por: Ding, Ni, et al.
Publicado: (2025)

Capacity Bounds on Doppler OFDM Channels
por: Orellana, Pablo, et al.
Publicado: (2026)

List-Decoding Capacity Implies Capacity on the q-ary Symmetric Channel
por: Pernice, Francisco, et al.
Publicado: (2024)

On the Capacity of Hierarchical Secure Aggregation with Groupwise Keys
por: Lu, Minyang, et al.
Publicado: (2026)

Estimating Rate-Distortion Functions Using the Energy-Based Model
por: Wu, Shitong, et al.
Publicado: (2025)