default search action
Erozan M. Kurtas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [j6]Mustafa Nazmi Kaynak, Tolga M. Duman, Erozan M. Kurtas:
Belief Propagation over SISO/MIMO Frequency Selective Fading Channels. IEEE Trans. Wirel. Commun. 6(6): 2001-2005 (2007) - [c21]Jun Hu, Tolga M. Duman, Erozan M. Kurtas, Mehmet Fatih Erden:
Belief Propagation Based Multihead Multitrack Detection over Conventional and Bit-Patterned Media Storage Systems. CISS 2007: 74-79 - [c20]Jun Hu, Tolga M. Duman, Erozan M. Kurtas, Mehmet Fatih Erden:
Detection Algorithms and Information Rates for Bit-Patterned Media Storage Systems with Written-in Errors. ISIT 2007: 2526-2530 - 2006
- [c19]Alexander V. Kuznetsov, Erozan M. Kurtas:
Block (0, k) Codes Designed by Coded Bit Stuffing. ICC 2006: 2981-2984 - [c18]Wei Zeng, Mehmet Fatih Erden, Aleksandar Kavcic, Erozan M. Kurtas, Raman Venkataramani:
Trellis-Based Baud-rate Timing Recovery Loop for Magnetic Recording Channels. ICC 2006: 3179-3184 - 2005
- [c17]Nitin Nangare, Krishna R. Narayanan, Xueshi Yang, Erozan M. Kurtas:
Joint timing recovery, ISI equalization and decoding using per-survivor BCJR-DFE. GLOBECOM 2005: 5 - [c16]Mustafa Nazmi Kaynak, Tolga M. Duman, Erozan M. Kurtas:
Belief Propagation over MIMO Frequency Selective Fading Channels. ICAS/ICNS 2005: 45 - [c15]Raman Venkataramani, Mehmet Fatih Erden, Erozan M. Kurtas:
Effect of Preamplifier on Timing Recovery in Magnetic Recording Channels. ICAS/ICNS 2005: 95 - [c14]Erozan M. Kurtas, Mehmet Fatih Erden, Xueshi Yang:
Future read channel technologies and challenges for high density data storage applications. ICASSP (5) 2005: 737-740 - [c13]Piya Kovintavewat, John R. Barry, Mehmet Fatih Erden, Erozan M. Kurtas:
Reduced-complexity per-survivor iterative timing recovery for coded partial response channels. ICASSP (3) 2005: 841-844 - [c12]Mustafa Nazmi Kaynak, Tolga M. Duman, Erozan M. Kurtas:
Noise predictive belief propagation. ICC 2005: 704-708 - 2004
- [j5]Zheng Zhang, Tolga M. Duman, Erozan M. Kurtas:
Achievable information rates and coding for MIMO systems over ISI channels and frequency-selective fading channels. IEEE Trans. Commun. 52(10): 1698-1710 (2004) - [c11]Piya Kovintavewat, John R. Barry, Mehmet Fatih Erden, Erozan M. Kurtas:
Per-survivor iterative timing recovery for coded partial response channels. GLOBECOM 2004: 2604-2608 - [c10]Piya Kovintavewat, John R. Barry, Mehmet Fatih Erden, Erozan M. Kurtas:
Per-survivor timing recovery for uncoded partial response channels. ICC 2004: 2715-2719 - [c9]Mustafa Nazmi Kaynak, Tolga M. Duman, Erozan M. Kurtas:
Belief propagation over frequency selective fading channels. VTC Fall (2) 2004: 1367-1371 - 2003
- [c8]Piya Kovintavewat, John R. Barry, Mehmet Fatih Erden, Erozan M. Kurtas:
A new timing recovery architecture for fast convergence. ISCAS (2) 2003: 13-16 - 2002
- [j4]Jing Li, Krishna R. Narayanan, Erozan M. Kurtas, Costas N. Georghiades:
On the performance of high-rate TPC/SPC codes and LDPC codes over partial response channels. IEEE Trans. Commun. 50(5): 723-734 (2002) - [c7]Jing (Tiffany) Li, Erozan M. Kurtas:
A Class of High-rate, Low-complexity, Well- structured LDPC Codes from Combinatorial Designs and their Applications on ISI Channels. Communications, Internet, and Information Technology 2002: 418-425 - [c6]Zheng Zhang, Tolga M. Duman, Erozan M. Kurtas:
Information theoretical limits of binary-input ISI channels with signal-dependent correlated Gaussian noise. GLOBECOM 2002: 1329-1333 - 2001
- [j3]Hongwei Song, B. V. K. Vijaya Kumar, Erozan M. Kurtas, Yifei Yuan, L. L. McPheters, Steven W. McLaughlin:
Iterative decoding for partial response (PR), equalized, magneto-optical (MO) data storage channels. IEEE J. Sel. Areas Commun. 19(4): 774-782 (2001) - [j2]Tolga M. Duman, Erozan M. Kurtas:
Performance bounds for high rate linear codes over partial-response channels. IEEE Trans. Inf. Theory 47(3): 1201-1205 (2001) - [c5]Jing Li, Erozan M. Kurtas, Krishna R. Narayanan, Costas N. Georghiades:
Iterative decoding of turbo product codes over PR-equalized Lorentzian channels with colored noise. GLOBECOM 2001: 2972-2976 - [c4]Jing Li, Erozan M. Kurtas, Krishna R. Narayanan, Costas N. Georghiades:
On the performance of turbo product codes and LDPC codes over partial-response channels. ICC 2001: 2176-2183 - [c3]Tolga M. Duman, Erozan M. Kurtas:
Maximum likelihood decoding bounds for high rate turbo codes over Lorentzian channels. ICC 2001: 2194-2198 - 2000
- [c2]Hongwei Song, B. V. K. Vijaya Kumar, Yifei Yuan, Erozan M. Kurtas:
Turbo Decoding for Optical Data Storage. ICC (1) 2000: 104-108
1990 – 1999
- 1999
- [c1]Dimitris N. Kalofonos, Erozan M. Kurtas, John G. Proakis:
Performance comparisons of concatenated codes with iterative decoding for DS-CDMA systems with application to IS-95-based cellular systems. WCNC 1999: 461-465 - 1997
- [j1]Erozan M. Kurtas, John G. Proakis, Masoud Salehi:
Coding for multitrack magnetic recording systems. IEEE Trans. Inf. Theory 43(6): 2020-2023 (1997)
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-11-26 20:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint