default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMustafa Cemil Coskun
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Peihong Yuan
, Mustafa Cemil Coskun:
Successive Cancellation Ordered Search Decoding of Modified GN-Coset Codes. IEEE Trans. Commun. 72(6): 3141-3154 (2024)- [c7]Mustafa Cemil Coskun:
Precoded Polar Product Codes. ISIT 2024: 3368-3373 - [i13]Mustafa Cemil Coskun:
Precoded Polar Product Codes. CoRR abs/2402.06767 (2024) - 2023
- [j6]Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier, Henry D. Pfister:
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding. IEEE Trans. Inf. Theory 69(2): 823-841 (2023) - 2022
- [j5]Mustafa Cemil Coskun, Henry D. Pfister:
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design. IEEE Trans. Inf. Theory 68(9): 5779-5791 (2022) - 2021
- [j4]Peihong Yuan, Mustafa Cemil Coskun, Gerhard Kramer:
Polar-Coded Non-Coherent Communication. IEEE Commun. Lett. 25(6): 1786-1790 (2021) - [c6]Peihong Yuan, Mustafa Cemil Coskun:
Complexity-Adaptive Maximum-Likelihood Decoding of Modified GN-Coset Codes. ITW 2021: 1-6 - [i12]Peihong Yuan, Mustafa Cemil Coskun, Gerhard Kramer:
Polar-Coded Non-Coherent Communication. CoRR abs/2102.10719 (2021) - [i11]Mustafa Cemil Coskun, Henry D. Pfister:
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design. CoRR abs/2103.16680 (2021) - [i10]Peihong Yuan, Mustafa Cemil Coskun:
Complexity-Adaptive Maximum-Likelihood Decoding of Modified GN-Coset Codes. CoRR abs/2105.04048 (2021) - [i9]Peihong Yuan, Mustafa Cemil Coskun:
Successive Cancellation Ordered Search Decoding of Modified GN-Coset Codes. CoRR abs/2112.10735 (2021) - 2020
- [c5]Mustafa Cemil Coskun, Joachim Neu, Henry D. Pfister:
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes. ISIT 2020: 437-442 - [c4]Mustafa Cemil Coskun, Henry D. Pfister:
Bounds on the List Size of Successive Cancellation List Decoding. SPCOM 2020: 1-5 - [i8]Mustafa Cemil Coskun, Joachim Neu, Henry D. Pfister:
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes. CoRR abs/2004.05969 (2020) - [i7]Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier, Henry D. Pfister:
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding. CoRR abs/2008.06938 (2020)
2010 – 2019
- 2019
- [j3]Mustafa Cemil Coskun, Thomas Jerkovits, Gianluigi Liva:
Successive Cancellation List Decoding of Product Codes With Reed-Muller Component Codes. IEEE Commun. Lett. 23(11): 1972-1976 (2019) - [j2]Mustafa Cemil Coskun, Giuseppe Durisi, Thomas Jerkovits, Gianluigi Liva, William E. Ryan, Brian Stein, Fabian Steiner:
Efficient error-correcting codes in the short blocklength regime. Phys. Commun. 34: 66-79 (2019) - [j1]Johan Östman, Giuseppe Durisi, Erik G. Ström, Mustafa Cemil Coskun, Gianluigi Liva:
Short Packets Over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission? IEEE Trans. Commun. 67(2): 1521-1536 (2019) - [c3]Marvin Xhemrishi, Mustafa Cemil Coskun, Gianluigi Liva, Johan Östman, Giuseppe Durisi:
List Decoding of Short Codes for Communication over Unknown Fading Channels. ACSSC 2019: 810-814 - [c2]Joachim Neu, Mustafa Cemil Coskun, Gianluigi Liva:
Ternary Quantized Polar Code Decoders: Analysis and Design. ACSSC 2019: 1724-1728 - [i6]Mustafa Cemil Coskun, Gianluigi Liva, Johan Östman, Giuseppe Durisi:
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes. CoRR abs/1901.05409 (2019) - [i5]Mustafa Cemil Coskun, Thomas Jerkovits, Gianluigi Liva:
Successive Cancellation List Decoding of Product Codes with Reed-Muller Component Codes. CoRR abs/1908.10397 (2019) - [i4]Joachim Neu, Mustafa Cemil Coskun, Gianluigi Liva:
Ternary Quantized Polar Code Decoders: Analysis and Design. CoRR abs/1910.01176 (2019) - 2018
- [i3]Mustafa Cemil Coskun, Giuseppe Durisi, Thomas Jerkovits, Gianluigi Liva, William E. Ryan, Brian Stein, Fabian Steiner:
Efficient Error-Correcting Codes in the Short Blocklength Regime. CoRR abs/1812.08562 (2018) - 2017
- [c1]Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier:
Successive cancellation decoding of single parity-check product codes. ISIT 2017: 1763-1767 - [i2]Mustafa Cemil Coskun, Gianluigi Liva, Alexandre Graell i Amat, Michael Lentmaier:
Successive Cancellation Decoding of Single Parity-Check Product Codes. CoRR abs/1706.05238 (2017) - [i1]Johan Östman, Giuseppe Durisi, Erik G. Ström, Mustafa Cemil Coskun, Gianluigi Liva:
Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission? CoRR abs/1712.06387 (2017)
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-10-13 17:59 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:
