Sason, Igal - Department of Electrical Engineering, Technion, Israel Institute of Technology

Advanced Search

Sason, Igal - Department of Electrical Engineering, Technion, Israel Institute of Technology

Linear Programming Bounds on the Degree Distributions of LDPC Code Ensembles
ON UNIVERSAL LDPC CODE ENSEMBLES Igal Sason Boaz Shuval
Parity-Check Density versus Performance of Binary Linear Block Codes over Memoryless Symmetric
On Interleaved, Differentially Encoded Convolutional Codes Michael Peleg, Igal Sason, Shlomo Shamai (Shitz) and Avner Elia
ACCEPTED TO IEEE TRANS. ON INFORMATION THEORY. FINAL VERSION, APRIL 2011 1 ON UNIVERSAL LDPC CODES OVER
TO APPEAR IN THE IEEE TRANSACTIONS ON INFORMATION THEORY, AUGUST 2010. 1 Performance Bounds for Erasure, List and Decision
ACCEPTED TO THE IEEE TRANSACTIONS ON INFORMATION THEORY, REVISED FEBRUARY 2009. 1 Bounds on the Number of Iterations for Turbo-Like
Accumulate-Repeat-Accumulate Codes: Capacity-Achieving Ensembles of Systematic Codes
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
On the Error Exponents of Improved Tangential Sphere Bounds
Complexity versus Performance of Capacity-Achieving Irregular Repeat-Accumulate Codes on the Binary
Tight Exponential Upper Bounds on the ML Decoding Error Probability of Block Codes Over Fully Interleaved Fading Channels
Variations on the Gallager Bounds, Connections and Applications
On the Asymptotic Input-Output Weight Distributions and Thresholds of Convolutional and Turbo-Like Codes
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum
IEEE COMMUNICATIONS LETTERS, VOL. 4, NO. 3, MARCH 2000 89 Improved Upper Bounds on the Ensemble
Improved Upper Bounds on the ML Decoding Error Probability of Parallel and Serial Concatenated Turbo
Bounds on the Error Probability of ML Decoding for Block and Turbo-Block Codes
Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels
Bounds on the Number of Iterations for Turbo-Like Code Ensembles over the Binary Erasure Channel
Bounds on the Convergence Speed of Iterative Message-Passing Decoders over the Binary
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Capacity-Achieving Accumulate-Repeat-Accumulate Codes for the BEC with Bounded Complexity
Performance versus Complexity Per Iteration for LDPC Codes: An Information Theoretic Approach
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary Erasure
On the Parity-Check Density and Achievable Rates of LDPC Codes for Memoryless Binary-Input
An Improved Sphere-Packing Bound for Finite-Length Codes over Symmetric Memoryless Channels
An Improved Sphere-Packing Bound for Finite-Length Codes over Symmetric Memoryless
Accumulate-Repeat-Accumulate Codes: Systematic Codes Achieving the Binary
Gallager-Type Bounds for Non-Binary Linear Block Codes over Memoryless Symmetric Channels
On the Density of Parity-Check Matrices of Capacity-Approaching Binary and Linear Codes on
Recent Results on Capacity-Achieving Codes for the Erasure Channel with Bounded Complexity
On Achievable Rates and Complexity of LDPC Codes over Parallel Channels: Bounds and
Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
On Universal Properties of Capacity-Approaching LDPC Code Ensembles
On the Error Exponents of Improved Tangential-Sphere Bounds
Theoretic and Practical Aspects on the Performance versus Complexity Tradeoff for
THEORETICAL AND PRACTICAL ASPECTS ON THE PERFORMANCE
Gallager-Type Bounds for Parallel Channels with Applications to Modern Coding Techniques
TIGHTENED UPPER BOUNDS ON THE ML DECODING ERROR
Performance versus Complexity Per Iteration for LDPC Codes: An Information Theoretic Approach
On Improved Bounds on the Decoding Error Probability of Block Codes over Interleaved Fading
TO APPEAR IN THE IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 5, MAY 2008 1 An Improved Sphere-Packing Bound for Finite-Length Codes
On the Fundamental System of Cycles in the Bipartite Graphs of LDPC Code Ensembles
On Universal LDPC Code Ensembles Igal Sason Boaz Shuval
On Achievable Rate Regions for the Gaussian Interference Channel
Parity-Check Density versus Performance of Binary Linear Block Codes: New Bounds and Applications
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
TO APPEAR IN THE IEEE TRANSACTIONS ON INFORMATION THEORY, JULY 2009. 1 On Universal Properties of Capacity-Approaching
Linear Programming Bounds on the Degree Distributions of LDPC Code Ensembles
On the Tradeoff Between Performance and Complexity for Codes on Graphs: Bounds and Constructions
On the Parity-Check Density and Achievable Rates of LDPC Codes for
On the Fundamental System of Cycles in the Bipartite Graphs of LDPC Code Ensembles
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes
Analytical Bounds on Maximum-Likelihood Decoded Linear Codes with Applications to Turbo-Like Codes: An Overview
Log-Domain Calculation of the 1959 Sphere-Packing Bound with Application to M-ary PSK Block Coded Modulation
Information-Theoretic Bounds on the Parity-Check Density of LDPC Codes: Old and New Results
Capacity-Achieving Ensembles for the Binary Erasure Channel with Bounded Complexity
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
Information-Theoretic Bounds on the Parity-Check Density of LDPC Codes: Old and New Results
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
On Universal Properties of Capacity-Approaching LDPC Code Ensembles
On the Error Exponents of Improved Tangential-Sphere Bounds
The Tangential-Sphere Bound and Improved Versions Gallager (1965) Bound
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
Capacity-Achieving Codes for the Binary Erasure Channel with Bounded Complexity
Information-Theoretic Bounds on the Parity-Check Density of LDPC Codes: Previous and Recent Results
Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes
Performance Analysis of Linear Codes under
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
SUBMITTED TO THE IEEE TRANSACTIONS ON INFORMATION THEORY ON APRIL 23, 2008. REVISED OCTOBER 30, 2008. 1 Performance Bounds for Non-Binary Linear Block
Polar Coding for Parallel Channels Eran Hof Igal Sason Shlomo Shamai Chao Tian
On Concentration and Moderate-Deviations Analysis of Binary Hypothesis Testing
On the Concentration of the Crest Factor for OFDM Department of Electrical Engineering
On Concentration of Measures for LDPC Code Igal Sason Ronen Eshel
On the Concentration of the Crest Factor for OFDM Department of Electrical Engineering
Aspects of convex optimization and concentration in Ronen Eshel
On Concentration of Measures for LDPC Code Ensembles Igal Sason Ronen Eshel
On Concentration for Martingales and Applications in Information Theory and Communications
On the Concentration of the Crest Factor for OFDM Signals