Cover Image

ORBGRAND: Achievable Rate for General Bit Channels and Application in BICM

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Zhuang, Zhang, Wenyi
Format:	Preprint
Published:	2024
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

On Achievable Rates for the Shotgun Sequencing Channel with Erasures
by: Narayanan, Hrishi, et al.
Published: (2024)

On Achievable Rates Over Noisy Nanopore Channels
by: Rameshwar, V. Arvind, et al.
Published: (2025)

Achievable Rates for Four-Dimensional Coded Modulation with a Bit-Wise Receiver
by: Alvarado, Alex, et al.
Published: (2013)

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

How to Increase the Achievable Information Rate by Per-Channel Dispersion Compensation
by: Keykhosravi, Kamran, et al.
Published: (2018)

Achievable Rates and Error Exponents for a Class of Mismatched Compound Channels
by: Patel, Priyanka, et al.
Published: (2025)

An Achievable Rate-Distortion Region of Joint Identification and Sensing for Multiple Access Channels
by: Zhao, Yaning, et al.
Published: (2024)

Maximum Achievable Rate of Resistive Random-Access Memory Channels by Mutual Information Spectrum Analysis
by: Song, Guanghui, et al.
Published: (2024)

An Achievable Rate-Distortion Region for Joint State and Message Communication over Multiple Access Channels
by: Li, Xinyang, et al.
Published: (2024)

Achievable Rates and Error Probability Bounds of Frequency-based Channels of Unlimited Input Resolution
by: Tamir, Ran, et al.
Published: (2025)

Achievable Rates for a Distributed Antenna System with No Channel State Information at the Central Processor
by: Song, Yi, et al.
Published: (2025)

On the Information Loss of the Max-Log Approximation in BICM Systems
by: Ivanov, Mikhail, et al.
Published: (2014)

Achievable Rate Regions for Multi-terminal Quantum Channels via Coset Codes
by: Gouiaa, Fatma, et al.
Published: (2025)

Achievable Rates of Nanopore-based DNA Storage
by: McBain, Brendon, et al.
Published: (2025)

An Achievable Rate Region for $3-$User Classical-Quantum Broadcast Channels
by: Gouiaa, Fatma, et al.
Published: (2022)

Achievability Bounds of Coding with Finite Blocklength for Gaussian Broadcast Channels
by: Ünsal, Ayşe, et al.
Published: (2026)

An Achievable Scheme for the K-user Linear Computation Broadcast Channel
by: Ma, Yinbin, et al.
Published: (2025)

Simultaneous Decoding of Classical Coset Codes over $3-$User Quantum Broadcast Channel: New Achievable Rate Regions
by: Gouiaa, Fatma, et al.
Published: (2025)

Nonlinearity Mitigation in WDM Systems: Models, Strategies, and Achievable Rates
by: Secondini, Marco, et al.
Published: (2018)

Achievable Rates for Information Extraction from a Strategic Sender
by: Vora, Anuj S., et al.
Published: (2023)

Error-Correcting Weakly Constrained Codes: Constructions and Achievable Rates
by: Mishra, Prachi, et al.
Published: (2026)

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

Enhanced BICM Receivers for Ultra-Reliable Low-Latency Short Packet Communications
by: Sy, Mody, et al.
Published: (2024)

Achievable Rate and Coding Principle for MIMO Multicarrier Systems With Cross-Domain MAMP Receiver Over Doubly Selective Channels
by: Chi, Yuhao, et al.
Published: (2026)

Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels
by: Boche, Holger, et al.
Published: (2025)

Broadcast Channels with Heterogeneous Arrival and Decoding Deadlines: Second-Order Achievability
by: Nikbakht, Homa, et al.
Published: (2023)

BICM-compatible Rate Adaptive Geometric Constellation Shaping Using Optimized Many-to-one Labeling
by: Yankov, Metodi Plamenov, et al.
Published: (2023)

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

Maximal Achievable Service Rates of Codes and Connections to Combinatorial Designs
by: Ly, Hoang, et al.
Published: (2025)

An Achievability Bound for Variable-Length Stop-Feedback Coding over the Gaussian Channel
by: Papoutsidakis, Ioannis, et al.
Published: (2024)

Achievable Rate Optimization for Stacked Intelligent Metasurface-Assisted Holographic MIMO Communications
by: Papazafeiropoulos, Anastasios, et al.
Published: (2024)

Optimum Achievable Rates in Two Random Number Generation Problems with $f$-Divergences Using Smooth Rényi Entropy
by: Nomura, Ryo, et al.
Published: (2024)

Entanglement-Assisted Bosonic MAC: Achievable Rates and Covert Communication
by: Shen, Yu-Chen, et al.
Published: (2026)

Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel
by: Morozov, Ruslan, et al.
Published: (2025)