Gil Wiechman - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 6 from 6

2008

Correction to On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications [Feb 07 580-598]Igal Sason, Gil Wiechman. TIT, 54(7):3368, 2008. [doi]

Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channelIgal Sason, Gil Wiechman. isit 2008: 1898-1902 [doi]

An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless ChannelsGil Wiechman, Igal Sason. TIT, 54(5):1962-1990, 2008. [doi]

2007

On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and ApplicationsIgal Sason, Gil Wiechman. TIT, 53(2):580-598, 2007. [doi]

Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and ApplicationsGil Wiechman, Igal Sason. TIT, 53(2):550-579, 2007. [doi]

2006

On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and ApplicationsIgal Sason, Gil Wiechman. isit 2006: 406-410 [doi]

Sign in or sign up to see more results.

runs on WebDSL