activity
20052025
most citedDeep Learning Methods for Improved Decoding of Linear Codes

571 citations · 922 across the 17 of their papers we have counts for

collaborators
Showing cs.ITShow all

20 papers · 1 filter

cs.IT2025

On the error correction of iterative bounded distance decoding of generalized LDPC codes

David Burshtein

Consider an ensemble of regular generalized LDPC (GLDPC) codes and assume that the same component code is associated with each parity check node. To decode a GLDPC code from the en…

cs.IT2021

Efficient Belief Propagation List Ordered Statistics Decoding of Polar Codes

Yonatan Urman, Guy Mogilevsky, David Burshtein

New algorithms for efficient decoding of polar codes (which may be CRC-augmented), transmitted over either a binary erasure channel (BEC) or an additive white Gaussian noise channe…

cs.IT2021

Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel

Yonatan Urman, David Burshtein

A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorith…

cs.IT2021

Belief Propagation List Ordered Statistics Decoding of Polar Codes

Guy Mogilevsky, David Burshtein

It is shown how to combine ordered statistics decoding (OSD) with CRC-aided belief propagation list (CBPL) decoding of polar codes. Even when the reprocessing order of the OSD is a…

cs.IT2020

Feedback Channel Communication with Low Precision Arithmetic

Yonatan Urman, David Burshtein

The problem of communicating over an additive white Gaussian noise channel with feedback, using low precision arithmetic, is considered. The Schalkwijk-Kailath (SK) scheme is known…

cs.IT2019

On Polar Coding for Binary Dirty Paper

Barak Beilin, David Burshtein

The problem of communication over binary dirty paper (DP) using nested polar codes is considered. An improved scheme, focusing on low delay, short to moderate blocklength communica…