default search action
Erdal Arikan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j34]Erdal Arikan
:
Entropy polarization in butterfly transforms. Digit. Signal Process. 119: 103207 (2021) - 2020
- [j33]Erdal Arikan:
Systematic Encoding and Shortening of PAC Codes. Entropy 22(11): 1301 (2020) - [i13]Mohsen Moradi
Performance and Complexity of Sequential Decoding of PAC Codes. CoRR abs/2012.04990 (2020)
2010 – 2019
- 2019
- [j32]Meysam Masoudi
Green Mobile Networks for 5G and Beyond. IEEE Access 7: 107270-107299 (2019) - [c21]Altug Süral, E. Göksu Sezer, Yigit Ertugrul, Orhan Arikan
Terabits-per-Second Throughput for Polar Codes. PIMRC Workshops 2019: 1-7 - [i12]Erdal Arikan:
From sequential decoding to channel polarization and back again. CoRR abs/1908.09594 (2019) - 2018
- [j31]Erdal Arikan
Serially Concatenated Polar Codes. IEEE Access 6: 64549-64555 (2018) - [j30]T. S. Jayram
A Note on Some Inequalities Used in Channel Polarization and Polar Coding. IEEE Trans. Inf. Theory 64(8): 5767-5768 (2018) - 2016
- [j29]Erdal Arikan, Daniel J. Costello Jr., Jörg Kliewer, Michael Lentmaier, Paul H. Siegel, Rüdiger L. Urbanke, Michael B. Pursley:
Guest Editorial Recent Advances in Capacity Approaching Codes. IEEE J. Sel. Areas Commun. 34(2): 205-208 (2016) - [j28]Erdal Arikan:
On the Origin of Polar Coding. IEEE J. Sel. Areas Commun. 34(2): 209-223 (2016) - [j27]Onur Dizdar
A High-Throughput Energy-Efficient Implementation of Successive Cancellation Decoder for Polar Codes Using Combinational Logic. IEEE Trans. Circuits Syst. I Regul. Pap. 63-I(3): 436-447 (2016) - [j26]Erdal Arikan
Varentropy Decreases Under the Polar Transform. IEEE Trans. Inf. Theory 62(6): 3390-3400 (2016) - [i11]T. S. Jayram, Erdal Arikan:
A note on some inequalities used in channel polarization and polar coding. CoRR abs/1607.00355 (2016) - 2015
- [j25]Erdal Arikan, Michael Lentmaier, Guido Montorsi:
Special issue on advances in channel coding. J. Commun. Networks 17(4): 325-327 (2015) - [j24]Erdal Arikan, Najeeb ul Hassan, Michael Lentmaier, Guido Montorsi, Jossy Sayir
Challenges and some new directions in channel coding. J. Commun. Networks 17(4): 328-338 (2015) - [c20]Erdal Arikan:
A packing lemma for polar codes. ISIT 2015: 2441-2445 - [i10]Erdal Arikan:
Variance of Entropy Decreases Under the Polar Transform. CoRR abs/1501.05005 (2015) - [i9]Erdal Arikan, Najeeb ul Hassan, Michael Lentmaier, Guido Montorsi, Jossy Sayir:
Challenges and some new directions in channel coding. CoRR abs/1504.03916 (2015) - [i8]Erdal Arikan:
A Packing Lemma for Polar Codes. CoRR abs/1504.05793 (2015) - [i7]Erdal Arikan:
On the Origin of Polar Coding. CoRR abs/1511.04838 (2015) - 2014
- [c19]Erdal Arikan:
A note on polarization martingales. ISIT 2014: 1466-1468 - [i6]Onur Dizdar, Erdal Arikan:
A High-Throughput Energy-Efficient Implementation of Successive-Cancellation Decoder for Polar Codes Using Combinational Logic. CoRR abs/1412.3829 (2014) - 2013
- [c18]Alptekin Pamuk, Erdal Arikan:
A two phase successive cancellation decoder architecture for polar codes. ISIT 2013: 957-961 - 2012
- [c17]Erdal Arikan:
Polar coding for the Slepian-Wolf problem based on monotone chain rules. ISIT 2012: 566-570 - [c16]Semih Cayci, Orhan Arikan
Polar code construction for non-binary source alphabets. SIU 2012: 1-4 - 2011
- [j23]Erdal Arikan:
Systematic Polar Coding. IEEE Commun. Lett. 15(8): 860-862 (2011) - 2010
- [j22]Ayça Özçelikkale, Haldun M. Özaktas, Erdal Arikan:
Signal recovery with cost-constrained measurements. IEEE Trans. Signal Process. 58(7): 3607-3617 (2010) - [c15]Erdal Arikan:
Source polarization. ISIT 2010: 899-903 - [i5]Erdal Arikan:
Source Polarization. CoRR abs/1001.3087 (2010)
2000 – 2009
- 2009
- [j21]A. Serdar Tan, Anil Aksay, Gozde Bozdagi Akar
Rate-Distortion Optimization for Stereoscopic Video Streaming with Unequal Error Protection. EURASIP J. Adv. Signal Process. 2009 (2009) - [j20]Erdal Arikan:
Channel polarization: a method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Trans. Inf. Theory 55(7): 3051-3073 (2009) - [c14]Erdal Arikan, Emre Telatar:
On the rate of channel polarization. ISIT 2009: 1493-1495 - [c13]Saqib Ali, Garik Markarian
Novel Predistortion Algorithm for OFDMA. VTC Spring 2009 - [i4]Eren Sasoglu, Emre Telatar, Erdal Arikan:
Polarization for arbitrary discrete memoryless channels. CoRR abs/0908.0302 (2009) - 2008
- [c12]Erdal Arikan:
Channel polarization: A method for constructing capacity-achieving codes. ISIT 2008: 1173-1177 - [i3]Erdal Arikan, Emre Telatar:
On the Rate of Channel Polarization. CoRR abs/0807.3806 (2008) - [i2]Erdal Arikan:
Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. CoRR abs/0807.3917 (2008) - 2007
- [c11]Ayça Özçelikkale, Haldun M. Özaktas, Erdal Arikan:
Optimal Measurement under Cost Constraints for Estimation of Propagating Wave Fields. ISIT 2007: 696-700 - 2006
- [j19]Erdal Arikan:
Channel combining and splitting for cutoff rate improvement. IEEE Trans. Inf. Theory 52(2): 628-639 (2006) - [c10]Erdal Arikan:
An Upper Bound on the Rate of Information Transfer by Grover's Oracle. GTIT-C 2006: 452-459 - [c9]Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
Information Theoretic Models in Language Evolution. GTIT-C 2006: 769-787 - [c8]Erdal Arikan:
Cutoff Rate Enhancement. GTIT-C 2006: 1066-1068 - [c7]Oguzhan Atak, Abdullah Atalar, Erdal Arikan, Harold Ishebabi, David Kammler, Gerd Ascheid, Heinrich Meyr, Mario Nicola, Guido Masera:
Design of Application Specific Processors for the Cached FFT Algorithm. ICASSP (3) 2006: 1028-1031 - [c6]Harold Ishebabi, Gerd Ascheid, Heinrich Meyr, Oguzhan Atak, Abdullah Atalar, Erdal Arikan:
An efficient parallelization technique for high throughput FFT-ASIPs. ISCAS 2006 - 2005
- [j18]Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
Information theoretic models in language evolution. Electron. Notes Discret. Math. 21: 97-100 (2005) - [j17]Erdal Arikan:
An upper bound on the rate of information transfer by Grover's oracle. Electron. Notes Discret. Math. 21: 231-232 (2005) - [c5]Erdal Arikan:
Channel combining and splitting for cutoff rate improvement. ISIT 2005: 671-675 - [i1]Erdal Arikan:
Channel combining and splitting for cutoff rate improvement. CoRR abs/cs/0508034 (2005) - 2004
- [j16]Erdal Arikan:
Correction to 'On the Reliability Exponent of the Exponential Server Timing Channel'. IEEE Trans. Inf. Theory 50(11): 2924 (2004) - [c4]Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe:
Language evolution and information theory. ISIT 2004: 139 - [c3]Erdal Arikan:
Capacity bounds for an ultra-wideband channel model. ITW 2004: 176-181 - 2003
- [c2]Seda Cakiroglu, Erdal Arikan:
Replacement Problem in Web Caching. ISCC 2003: 425-430 - 2002
- [j15]Erdal Arikan:
On the reliability exponent of the exponential timing channel. IEEE Trans. Inf. Theory 48(6): 1681-1689 (2002)
1990 – 1999
- 1999
- [j14]Neri Merhav, Ron M. Roth, Erdal Arikan:
Hierarchical Guessing with a Fidelity Criterion. IEEE Trans. Inf. Theory 45(1): 330-337 (1999) - [j13]Neri Merhav, Erdal Arikan:
The Shannon cipher system with a guessing wiretapper. IEEE Trans. Inf. Theory 45(6): 1860-1866 (1999) - 1998
- [j12]Erdal Arikan, Neri Merhav:
Guessing Subject to Distortion. IEEE Trans. Inf. Theory 44(3): 1041-1056 (1998) - [j11]Erdal Arikan, Neri Merhav:
Joint Source-Channel Coding and Guessing with Application to Sequential Decoding. IEEE Trans. Inf. Theory 44(5): 1756-1769 (1998) - 1996
- [j10]Nail Akar
A Numerically Efficient Method for a MAP/D/1/K Queue when Space and Service Times are Independent. Queueing Syst. Theory Appl. 22(1-2): 97-120 (1996) - [j9]Erdal Arikan:
An inequality on guessing and its application to sequential decoding. IEEE Trans. Inf. Theory 42(1): 99-105 (1996) - 1995
- [j8]Nail Akar
Markov Modulated Periodic Arrival Process Offered to an ATM Multiplexer. Perform. Evaluation 22(2): 175-190 (1995) - 1994
- [j7]Erdal Arikan:
An upper bound on the zero-error list-coding capacity. IEEE Trans. Inf. Theory 40(4): 1237-1240 (1994) - 1992
- [j6]Branko Radosavljevic, Erdal Arikan, Bruce E. Hajek:
Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks. IEEE Trans. Inf. Theory 38(6): 1833-1839 (1992) - [c1]Erdal Arikan:
A Bound on the Zero-Error List Coding Capacity. Coding And Quantization 1992: 235-241 - 1990
- [j5]Erdal Arikan:
An implementation of Elias coding for input-restricted channels. IEEE Trans. Inf. Theory 36(1): 162-165 (1990) - [j4]Erdal Arikan:
On the achievable rate region of sequential decoding for a class of multiaccess channels. IEEE Trans. Inf. Theory 36(1): 180-183 (1990)
1980 – 1989
- 1988
- [j3]Erdal Arikan:
An upper bound on the cutoff rate of sequential decoding. IEEE Trans. Inf. Theory 34(1): 55-63 (1988) - [j2]Erdal Arikan:
Sequential decoding for multiple access channels. IEEE Trans. Inf. Theory 34(2): 246-259 (1988) - 1985
- [b1]Erdal Arikan:
Sequential decoding for multiple access channels. Massachusetts Institute of Technology, Cambridge, MA, USA, 1985 - 1984
- [j1]Erdal Arikan:
Some complexity results about packet radio networks. IEEE Trans. Inf. Theory 30(4): 681-685 (1984)
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:33 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: