On Polar Coding for Side Information Channels

Barak Beilin, David Burshtein

Research output: Contribution to journalArticlepeer-review


We propose a successive cancellation list (SCL) encoding and decoding scheme for the Gelfand Pinsker (GP) problem based on the known nested polar coding scheme. It applies SCL encoding for the source coding part, and SCL decoding with a properly defined CRC for the channel coding part. The scheme shows improved performance compared to the existing method. A known issue with nested polar codes for binary dirty paper is the existence of frozen channel code bits that are not frozen in the source code. These bits need to be retransmitted in a second phase of the scheme, thus reducing the rate and increasing the required blocklength. We provide an improved bound on the size of this set, and on its scaling with respect to the blocklength, when the Bhattacharyya parameter of the test channel used for source coding is sufficiently large, or the Bhattacharyya parameter of the channel seen at the decoder is sufficiently small. The result is formulated for an arbitrary binary-input memoryless GP problem, since unlike the previous results, it does not require degradedness of the two channels mentioned above. Finally, we present simulation results for binary dirty paper and noisy write once memory codes.

Original languageEnglish
Article number9247135
Pages (from-to)673-685
Number of pages13
JournalIEEE Transactions on Information Theory
Issue number2
StatePublished - Feb 2021


  • Gelfand Pinsker problem
  • Polar codes
  • dirty paper problem
  • side information channels

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'On Polar Coding for Side Information Channels'. Together they form a unique fingerprint.

Cite this