default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGil Wiechman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j5]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): 2602-2617 (2009)- 2008
- [j4]Gil Wiechman, Igal Sason:
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels. IEEE Trans. Inf. Theory 54(5): 1962-1990 (2008) - [j3]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): 3368 (2008) - [c2]Igal Sason, Gil Wiechman:
Bounds on the number of iterations for turbo-like code ensembles over the binary erasure channel. ISIT 2008: 1898-1902 - 2007
- [j2]Gil Wiechman, Igal Sason:
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications. IEEE Trans. Inf. Theory 53(2): 550-579 (2007) - [j1]Igal Sason, Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications. IEEE Trans. Inf. Theory 53(2): 580-598 (2007) - [i8]Igal Sason, Gil Wiechman:
Bounds on the Number of Iterations for Turbo-Like Ensembles over the Binary Erasure Channe. CoRR abs/0711.1056 (2007) - 2006
- [c1]Igal Sason, Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications. ISIT 2006: 406-410 - [i7]Gil Wiechman, Igal Sason:
An Improved Sphere-Packing Bound for Finite-Length Codes on Symmetric Memoryless Channels. CoRR abs/cs/0608042 (2006) - [i6]Gil Wiechman, Igal Sason:
An Improved Sphere-Packing Bound Targeting Codes of Short to Moderate Block Lengths and Applications. CoRR abs/cs/0609094 (2006) - 2005
- [i5]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 abs/cs/0505057 (2005) - [i4]Gil Wiechman, Igal Sason:
On the Parity-Check Density and Achievable Rates of LDPC Codes. CoRR abs/cs/0505078 (2005) - [i3]Igal Sason, Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels with Application to Puncturing. CoRR abs/cs/0508072 (2005) - [i2]Igal Sason, Gil Wiechman:
Performance versus Complexity Per Iteration for Low-Density Parity-Check Codes: An Information-Theoretic Approach. CoRR abs/cs/0512075 (2005) - [i1]Igal Sason, Gil Wiechman:
On Achievable Rates and Complexity of LDPC Codes for Parallel Channels: Information-Theoretic Bounds and Applications. CoRR abs/cs/0512076 (2005)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
