Gil Wiechman
According to our database1,
Gil Wiechman
authored at least 14 papers
between 2005 and 2009.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2009
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel.
IEEE Trans. Inf. Theory, 2009
2008
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels.
IEEE Trans. Inf. Theory, 2008
Correction to "On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications" [Feb 07 580-598].
IEEE Trans. Inf. Theory, 2008
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008
2007
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications.
IEEE Trans. Inf. Theory, 2007
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications.
IEEE Trans. Inf. Theory, 2007
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe
CoRR, 2007
2006
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications
CoRR, 2006
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels
CoRR, 2006
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006
2005
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach
CoRR, 2005
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing
CoRR, 2005
Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes
CoRR, 2005