10 citations · 22 across the 8 of their papers we have counts for
8 papers · 1 filter
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
Igal Sason, Gil Wiechman
This paper provides simple lower bounds on the number of iterations which is required for successful message-passing decoding of some important families of graph-based code ensembl…
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
Gil Wiechman, Igal Sason
This paper derives an improved sphere-packing (ISP) bound targeting codes of short to moderate block lengths. We first review the 1967 sphere-packing (SP67) bound for discrete memo…
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
Gil Wiechman, Igal Sason
This paper derives an improved sphere-packing (ISP) bound for finite-length codes whose transmission takes place over symmetric memoryless channels. We first review classical resul…
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
Igal Sason, Gil Wiechman
The paper presents bounds on the achievable rates and the decoding complexity of low-density parity-check (LDPC) codes. It is assumed that the communication of these codes takes pl…
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
Igal Sason, Gil Wiechman
The paper is focused on the tradeoff between performance and decoding complexity per iteration for LDPC codes in terms of their gap (in rate) to capacity. The study of this tradeof…
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
Igal Sason, Gil Wiechman
This paper considers the achievable rates and decoding complexity of low-density parity-check (LDPC) codes over statistically independent parallel channels. The paper starts with t…