Cover Image

Sparse Superposition Codes with Binomial Dictionary are Capacity-Achieving with Maximum Likelihood Decoding

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Takeishi, Yoshinari, Takeuchi, Jun'ichi
Format:	Preprint
Published:	2025
Subjects:	Information Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Risk Bounds on MDL Estimators for Linear Regression Models with Application to Simple ReLU Neural Networks
by: Takeishi, Yoshinari, et al.
Published: (2024)

Asymptotically Minimax Regret by Bayes Mixtures
by: Takeuchi, Jun'ichi, et al.
Published: (2024)

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

Policy-Guided MCTS for near Maximum-Likelihood Decoding of Short Codes
by: Tian, Y., et al.
Published: (2025)

Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes
by: Mosheiff, Jonathan, et al.
Published: (2024)

LDPC Codes Achieve List Decoding Capacity
by: Mosheiff, Jonathan, et al.
Published: (2019)

Tensor Reed-Muller Codes: Achieving Capacity with Quasilinear Decoding Time
by: Abbe, Emmanuel, et al.
Published: (2026)

Capacity-Achieving BBT Polar Codes with Interleaver-Assisted BP Decoding
by: Yao, Xinyuanmeng, et al.
Published: (2026)

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

Explicit Subcodes of Reed-Solomon Codes that Efficiently Achieve List Decoding Capacity
by: Berman, Amit, et al.
Published: (2024)

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

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

An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
by: Baniasadi, Mohammadamin, et al.
Published: (2026)

Quantum Speedup for Polar Maximum Likelihood Decoding
by: Fujiwara, Shintaro, et al.
Published: (2024)

On the Computability of Finding Capacity-Achieving Codes
by: Gkekas, Angelos, et al.
Published: (2025)

Capacity-Achieving Codes for Noisy Insertion Channels
by: Liu, Hengfeng, et al.
Published: (2025)

Reduction of Sufficient Number of Code Tables of $k$-Bit Delay Decodable Codes
by: Hashimoto, Kengo, et al.
Published: (2024)

Capacity-Achieving Gray Codes
by: Guruswami, Venkatesan, et al.
Published: (2024)

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

Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths
by: Yamamoto, Hirosuke, et al.
Published: (2024)

Random Reed-Solomon Codes Achieve List-Decoding Capacity With Linear-Sized Alphabets
by: Alrabiah, Omar, et al.
Published: (2023)

Wideband Direct Satellite Uplink Enabled by Pilot-less Sparse Superposition Codes
by: Perotti, Alberto G., et al.
Published: (2026)

On the Error-Reducing Properties of Superposition Codes
by: Andreev, Kirill, et al.
Published: (2023)

Universal Maximum Likelihood (List) Decoding via Fast Vector-Matrix Multiplication
by: Ly, Hoang, et al.
Published: (2025)

Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
by: Pfister, Henry D., et al.
Published: (2026)

Normalized Maximum Likelihood Code-Length on Riemannian Data Spaces
by: Fukuzawa, Kota, et al.
Published: (2025)

Randomly Punctured Reed-Solomon Codes Achieve the List Decoding Capacity over Polynomial-Size Alphabets
by: Guo, Zeyu, et al.
Published: (2023)

Approximating Simple ReLU Networks based on Spectral Decomposition of Fisher Information
by: Ho, Ka Long Keith, et al.
Published: (2025)

Generic Reed-Solomon Codes Achieve List-decoding Capacity
by: Brakensiek, Joshua, et al.
Published: (2022)

Coding Theorems for Repetition and Superposition Codes over Binary-Input Output-Symmetric Channels
by: Wang, Yixin, et al.
Published: (2024)

Achieving Capacity of PIR with Private Side Information with Low Sub-packetization and without MDS Codes
by: Erhili, Leila, et al.
Published: (2024)

Study of Adaptive Reweighted Sparse Belief Propagation Decoders for Polar Codes
by: Oliveira, R. M., et al.
Published: (2024)

Beyond 1$\to$N Decoding: Capacity-Aware Rateless Polar Codes for IR-HARQ
by: Zhang, Huazi, et al.
Published: (2026)

On k-Mer-Based and Maximum Likelihood Estimation Algorithms for Trace Reconstruction
by: Cheng, Kuan, et al.
Published: (2023)

AG Codes Achieve List-decoding Capacity over Constant-sized Fields
by: Brakensiek, Joshua, et al.
Published: (2023)

Unique Decoding of Hyperderivative Reed-Solomon Codes
by: Gu, Haojie, et al.
Published: (2026)

Structured Superposition of Autoencoders for UEP Codes at Intermediate Blocklengths
by: Ninkovic, Vukan, et al.
Published: (2025)

Foundation of Calculating Normalized Maximum Likelihood for Continuous Probability Models
by: Suzuki, Atsushi, et al.
Published: (2024)

Asymmetric Encoding-Decoding Schemes for Lossless Data Compression
by: Yamamoto, Hirosuke, et al.
Published: (2026)

Distributed Source Coding, Multiple Description Coding, and Source Coding with Side Information at Decoders Using Constrained-Random Number Generators
by: Muramatsu, Jun
Published: (2024)