The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gil Wiechman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Gil Wiechman, Igal Sason
    Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:550-579 [Journal]
  2. Igal Sason, Gil Wiechman
    On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2007, v:53, n:2, pp:580-598 [Journal]
  3. Gil Wiechman, Igal Sason
    An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  4. Gil Wiechman, Igal Sason
    An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  5. Improved Bounds on the Parity-Check Density and Achievable Rates of Binary Linear Block Codes with Applications to LDPC Codes [Citation Graph (, )][DBLP]


  6. On the Parity-Check Density and Achievable Rates of LDPC Codes [Citation Graph (, )][DBLP]


  7. On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing [Citation Graph (, )][DBLP]


  8. Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach [Citation Graph (, )][DBLP]


  9. On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications [Citation Graph (, )][DBLP]


  10. Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002