Gil Wiechman

15 papers B 2Journal 13
YearRankTypeTitle / Venue / Authors
2009 J jnl
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel.
IEEE Trans. Inf. Theory
Igal Sason, Gil Wiechman
2008 J jnl
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels.
IEEE Trans. Inf. Theory
Gil Wiechman, Igal Sason
2008 B conf
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel.
ISIT
Igal Sason, Gil Wiechman
2008 J jnl
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598].
IEEE Trans. Inf. Theory
Igal Sason, Gil Wiechman
2007 J jnl
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
CoRR
Igal Sason, Gil Wiechman
2007 J jnl
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications.
IEEE Trans. Inf. Theory
Igal Sason, Gil Wiechman
2007 J jnl
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications.
IEEE Trans. Inf. Theory
Gil Wiechman, Igal Sason
2006 J jnl
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
CoRR
Gil Wiechman, Igal Sason
2006 J jnl
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
CoRR
Gil Wiechman, Igal Sason
2006 B conf
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications.
ISIT
Igal Sason, Gil Wiechman
2005 J jnl
Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes
CoRR
Gil Wiechman, Igal Sason
2005 J jnl
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
CoRR
Igal Sason, Gil Wiechman
2005 J jnl
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications
CoRR
Igal Sason, Gil Wiechman
2005 J jnl
On the Parity-Check Density and Achievable Rates of LDPC Codes
CoRR
Gil Wiechman, Igal Sason
2005 J jnl
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
CoRR
Igal Sason, Gil Wiechman