default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIdan Goldenberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j5]Idan Goldenberg, David Burshtein:
The Approximate Maximum-Likelihood Certificate. IEEE Trans. Inf. Theory 59(9): 6049-6059 (2013)- 2011
- [j4]Idan Goldenberg, David Burshtein:
Error bounds for repeat-accumulate codes decoded via linear programming. Adv. Math. Commun. 5(4): 555-570 (2011) - [j3]David Burshtein, Idan Goldenberg:
Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance. IEEE Trans. Inf. Theory 57(11): 7386-7402 (2011) - [c3]David Burshtein, Idan Goldenberg:
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes. ISIT 2011: 1263-1267 - [c2]Idan Goldenberg, David Burshtein:
The approximate maximum-likelihood certificate. ISIT 2011: 1278-1282 - [i6]Idan Goldenberg, David Burshtein:
The approximate maximum-likelihood certificate. CoRR abs/1105.3006 (2011) - 2010
- [c1]David Burshtein, Idan Goldenberg:
Improved linear programming decoding and bounds on the minimum distance of LDPC codes. ITW 2010: 1-5 - [i5]David Burshtein, Idan Goldenberg:
Improved linear programming decoding of LDPC codes and bounds on the minimum and fractional distance. CoRR abs/1012.1425 (2010)
2000 – 2009
- 2009
- [j2]Idan Goldenberg, David Burshtein:
Upper bound on error exponent of regular LDPC codes transmitted over the BEC. IEEE Trans. Inf. Theory 55(6): 2674-2681 (2009) - [i4]Idan Goldenberg, David Burshtein:
Error Bounds for Repeat-Accumulate Codes Decoded via Linear Programming. CoRR abs/0904.1692 (2009) - 2008
- [i3]Idan Goldenberg, David Burshtein:
Upper Bound on Error Exponent of Regular LDPC Codes Transmitted over the BEC. CoRR abs/0803.2460 (2008) - 2007
- [j1]Igal Sason, Idan Goldenberg:
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes. IEEE Trans. Inf. Theory 53(7): 2394-2428 (2007) - 2006
- [i2]Igal Sason, Idan Goldenberg:
Coding for Parallel Channels: Gallager Bounds for Binary Linear Codes with Applications to Repeat-Accumulate Codes and Variations. CoRR abs/cs/0607002 (2006) - [i1]Igal Sason, Idan Goldenberg:
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes. CoRR abs/cs/0609099 (2006)
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-24 23:09 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:
