default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEren Sasoglu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i15]Ayush Jain, Andrea Montanari, Eren Sasoglu:
Scaling laws for learning with real and surrogate data. CoRR abs/2402.04376 (2024)- 2020
- [j7]Lele Wang
, Young-Han Kim, Chiao-Yi Chen, Hosung Park, Eren Sasoglu:
Sliding-Window Superposition Coding: Two-User Interference Channels. IEEE Trans. Inf. Theory 66(6): 3293-3316 (2020)
2010 – 2019
- 2019
- [j6]Eren Sasoglu, Ido Tal:
Polar Coding for Processes With Memory. IEEE Trans. Inf. Theory 65(4): 1994-2003 (2019) - 2017
- [j5]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller Codes Achieve Capacity on Erasure Channels. IEEE Trans. Inf. Theory 63(7): 4298-4316 (2017) - [i14]Lele Wang, Young-Han Kim, Chiao-Yi Chen, Hosung Park, Eren Sasoglu:
Sliding-Window Superposition Coding: Two-User Interference Channels. CoRR abs/1701.02345 (2017) - 2016
- [j4]Eren Sasoglu, Lele Wang:
Universal Polarization. IEEE Trans. Inf. Theory 62(6): 2937-2946 (2016) - [c17]Hosein Nikopour, Wookbong Lee, Roya Doostnejad, Eren Sasoglu, Claudio R. C. M. da Silva, Huaning Niu, Shilpa Talwar:
Single Carrier Waveform Solution for Millimeter Wave Air Interface. GLOBECOM Workshops 2016: 1-6 - [c16]Eren Sasoglu, Ido Tal:
Polar coding for processes with memory. ISIT 2016: 225-229 - [c15]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller codes achieve capacity on erasure channels. STOC 2016: 658-669 - [i13]Shrinivas Kudekar, Santhosh Kumar, Marco Mondelli, Henry D. Pfister, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller Codes Achieve Capacity on Erasure Channels. CoRR abs/1601.04689 (2016) - [i12]Eren Sasoglu, Ido Tal:
Polar Coding for Processes with Memory. CoRR abs/1602.01870 (2016) - 2015
- [c14]Govinda M. Kamath, Eren Sasoglu, David N. C. Tse:
Optimal haplotype assembly from high-throughput mate-pair reads. ISIT 2015: 914-918 - [i11]Govinda M. Kamath, Eren Sasoglu, David N. C. Tse:
Optimal Haplotype Assembly from High-Throughput Mate-Pair Reads. CoRR abs/1502.01975 (2015) - [i10]Shrinivas Kudekar, Marco Mondelli, Eren Sasoglu, Rüdiger L. Urbanke:
Reed-Muller Codes Achieve Capacity on the Binary Erasure Channel under MAP Decoding. CoRR abs/1505.05831 (2015) - 2014
- [c13]Lele Wang, Eren Sasoglu:
Polar coding for interference networks. ISIT 2014: 311-315 - [c12]Eren Sasoglu, David Tse:
DNA assembly from paired reads as 2-D jigsaw puzzles. ISIT 2014: 1286-1290 - [c11]Eren Sasoglu, Lele Wang:
Universal polarization. ISIT 2014: 1456-1460 - [c10]Lele Wang, Eren Sasoglu, Young-Han Kim:
Sliding-window superposition coding for interference networks. ISIT 2014: 2749-2753 - [i9]Lele Wang, Eren Sasoglu:
Polar coding for interference networks. CoRR abs/1401.7293 (2014) - 2013
- [j3]Eren Sasoglu, Emre Telatar, Edmund M. Yeh:
Polar Codes for the Two-User Multiple-Access Channel. IEEE Trans. Inf. Theory 59(10): 6583-6592 (2013) - [c9]Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim, Eren Sasoglu, Lele Wang:
On the capacity region for index coding. ISIT 2013: 962-966 - [c8]Eren Sasoglu, Alexander Vardy:
A new polar coding scheme for strong security on wiretap channels. ISIT 2013: 1117-1121 - [c7]Lele Wang, Eren Sasoglu, Bernd Bandemer, Young-Han Kim:
A comparison of superposition coding schemes. ISIT 2013: 2970-2974 - [i8]Lele Wang, Eren Sasoglu, Bernd Bandemer, Young-Han Kim:
A Comparison of Superposition Coding Schemes. CoRR abs/1302.1258 (2013) - [i7]Fatemeh Arbabjolfaei, Bernd Bandemer, Young-Han Kim, Eren Sasoglu, Lele Wang:
On the Capacity Region for Index Coding. CoRR abs/1302.1601 (2013) - [i6]Eren Sasoglu, Lele Wang:
Universal Polarization. CoRR abs/1307.7495 (2013) - 2012
- [j2]Eren Sasoglu:
Polarization and Polar Codes. Found. Trends Commun. Inf. Theory 8(4): 259-381 (2012) - [c6]Eren Sasoglu:
Polar codes for discrete alphabets. ISIT 2012: 2137-2141 - 2011
- [b1]Eren Sasoglu:
Polar Coding Theorems for Discrete Systems. EPFL, Switzerland, 2011 - [c5]Eren Sasoglu:
Polarization in the presence of memory. ISIT 2011: 189-193 - 2010
- [j1]Satish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke:
Polar Codes: Characterization of Exponent, Bounds, and Constructions. IEEE Trans. Inf. Theory 56(12): 6253-6264 (2010) - [c4]Eren Sasoglu:
An entropy inequality for q-ary random variables and its application to channel polarization. ISIT 2010: 1360-1363 - [i5]Eren Sasoglu:
An entropy inequality for q-ary random variables and its application to channel polarization. CoRR abs/1006.2006 (2010) - [i4]Eren Sasoglu, Emre Telatar, Edmund M. Yeh:
Polar codes for the two-user multiple-access channel. CoRR abs/1006.4255 (2010)
2000 – 2009
- 2009
- [c3]Satish Babu Korada, Eren Sasoglu:
A class of transformations that polarize binary-input memoryless channels. ISIT 2009: 1478-1482 - [c2]Satish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke:
Polar codes: Characterization of exponent, bounds, and constructions. ISIT 2009: 1483-1487 - [i3]Satish Babu Korada, Eren Sasoglu, Rüdiger L. Urbanke:
Polar Codes: Characterization of Exponent, Bounds, and Constructions. CoRR abs/0901.0536 (2009) - [i2]Eren Sasoglu, Emre Telatar, Erdal Arikan:
Polarization for arbitrary discrete memoryless channels. CoRR abs/0908.0302 (2009) - 2008
- [c1]Eren Sasoglu:
Successive cancellation for cyclic interference channels. ITW 2008: 36-40 - [i1]Satish Babu Korada, Eren Sasoglu:
A Class of Transformations that Polarize Symmetric Binary-Input Memoryless Channels. CoRR abs/0811.1770 (2008)
Coauthor Index
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:57 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:
