Weighted Parity-Check Codes for Channels with State and Asymmetric Channels
Publication in refereed journal

Altmetrics Information
.

Other information
AbstractIn this paper, we introduce a new class of codes, called weighted parity-check codes, where each parity-check bit has a weight that indicates its likelihood to be one (instead of fixing each parity-check bit to be zero). It is applicable to a wide range of settings, e.g. asymmetric channels, channels with state and/or cost constraints, and the Wyner-Ziv problem, and can provably achieve the capacity. For the channel with state (Gelfand-Pinsker) setting, the proposed coding scheme has two advantages. First, it achieves the capacity of any channel with state (e.g. asymmetric channels). Second, simulation results show that the proposed code achieves a smaller error rate compared to the nested linear codes. We also discuss a sparse construction where the belief propagation algorithm can be applied to improve the coding efficiency.
Acceptance Date14/05/2024
All Author(s) ListChih Wei Ling, Yanxiao Liu, Cheuk Ting Li
Journal nameIEEE Transactions on Information Theory
Year2024
Month8
Volume Number70
Issue Number8
PublisherInstitute of Electrical and Electronics Engineers
Pages5573 - 5588
ISSN0018-9448
eISSN1557-9654
LanguagesEnglish-United States

Last updated on 2024-16-10 at 14:12