The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Erdal Arikan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Seda Cakiroglu, Erdal Arikan
    Replacement Problem in Web Caching. [Citation Graph (0, 0)][DBLP]
    ISCC, 2003, pp:425-430 [Conf]
  2. Erdal Arikan
    An Upper Bound on the Rate of Information Transfer by Grover's Oracle. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:452-459 [Conf]
  3. Erdal Arikan
    Cutoff Rate Enhancement. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:1066-1068 [Conf]
  4. Rudolf Ahlswede, Erdal Arikan, Lars Bäumer, Christian Deppe
    Information Theoretic Models in Language Evolution. [Citation Graph (0, 0)][DBLP]
    GTIT-C, 2006, pp:769-787 [Conf]
  5. Erdal Arikan
    On the reliability exponent of the exponential timing channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1681-1689 [Journal]
  6. Erdal Arikan
    Correction to 'On the Reliability Exponent of the Exponential Server Timing Channel'. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:11, pp:2924-2924 [Journal]
  7. Erdal Arikan
    Channel combining and splitting for cutoff rate improvement. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:2, pp:628-639 [Journal]
  8. Erdal Arikan
    Some complexity results about packet radio networks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1984, v:30, n:4, pp:681-0 [Journal]
  9. Erdal Arikan
    An upper bound on the cutoff rate of sequential decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:1, pp:55-63 [Journal]
  10. Erdal Arikan
    Sequential decoding for multiple access channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1988, v:34, n:2, pp:246-259 [Journal]
  11. Erdal Arikan
    An implementation of Elias coding for input-restricted channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:162-0 [Journal]
  12. Erdal Arikan
    On the achievable rate region of sequential decoding for a class of multiaccess channels. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1990, v:36, n:1, pp:180-0 [Journal]
  13. Erdal Arikan
    An upper bound on the zero-error list-coding capacity. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:4, pp:1237-0 [Journal]
  14. Erdal Arikan
    An inequality on guessing and its application to sequential decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:1, pp:99-105 [Journal]
  15. Erdal Arikan, Neri Merhav
    Guessing Subject to Distortion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:3, pp:1041-1056 [Journal]
  16. Erdal Arikan, Neri Merhav
    Joint Source-Channel Coding and Guessing with Application to Sequential Decoding. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1998, v:44, n:5, pp:1756-1769 [Journal]
  17. Neri Merhav, Erdal Arikan
    The Shannon cipher system with a guessing wiretapper. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:6, pp:1860-1866 [Journal]
  18. Neri Merhav, Ron M. Roth, Erdal Arikan
    Hierarchical Guessing with a Fidelity Criterion. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:1, pp:330-337 [Journal]
  19. Branko Radosavljevic, Erdal Arikan, Bruce E. Hajek
    Sequential decoding of low-density parity-check codes by adaptive reordering of parity checks. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1992, v:38, n:6, pp:1833-0 [Journal]

  20. Novel Predistortion Algorithm for OFDMA. [Citation Graph (, )][DBLP]


  21. Channel combining and splitting for cutoff rate improvement [Citation Graph (, )][DBLP]


  22. On the Rate of Channel Polarization [Citation Graph (, )][DBLP]


  23. Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels [Citation Graph (, )][DBLP]


  24. Polarization for arbitrary discrete memoryless channels [Citation Graph (, )][DBLP]


  25. Source Polarization [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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