Gil Wiechman

Publication Activity (10 Years)

Years Active: 2005-2009
Publications (10 Years): 0

Publications

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