Skip to main content

Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels

Conferences
Pfister, HD; Kashyap, N; Chamberland, JF; Reeves, G
Published in: IEEE International Symposium on Information Theory Proceedings
January 1, 2026

We study reliable communication over finite-state channels (FSCs) using Reed-Muller (RM) codes. Building on recent symmetry-based analyses for memoryless channels, we show that a sequence of binary RM codes (with some random scrambling) can achieve the symmetric capacity (or uniform-input information rate) of a binary-input indecomposable FSC.

Duke Scholars

Altmetric Attention Stats
Dimensions Citation Stats

Published In

IEEE International Symposium on Information Theory Proceedings

DOI

ISSN

2157-8095

Publication Date

January 1, 2026
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Pfister, H. D., Kashyap, N., Chamberland, J. F., & Reeves, G. (2026). Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels. In IEEE International Symposium on Information Theory Proceedings. https://doi.org/10.1109/ISIT62367.2026.11653887
Pfister, H. D., N. Kashyap, J. F. Chamberland, and G. Reeves. “Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels.” In IEEE International Symposium on Information Theory Proceedings, 2026. https://doi.org/10.1109/ISIT62367.2026.11653887.
Pfister HD, Kashyap N, Chamberland JF, Reeves G. Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels. In: IEEE International Symposium on Information Theory Proceedings. 2026.
Pfister, H. D., et al. “Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels.” IEEE International Symposium on Information Theory Proceedings, 2026. Scopus, doi:10.1109/ISIT62367.2026.11653887.
Pfister HD, Kashyap N, Chamberland JF, Reeves G. Reed-Muller Codes Achieve the Symmetric Capacity on Finite-State Channels. IEEE International Symposium on Information Theory Proceedings. 2026.

Published In

IEEE International Symposium on Information Theory Proceedings

DOI

ISSN

2157-8095

Publication Date

January 1, 2026