16 citations · 33 across the 14 of their papers we have counts for
15 papers
Enhanced Feedback Mechanisms for Resource-Efficient Incremental Redundancy
Mustafa Cemil Coşkun, Ahmed Elkelesh, Avijit Mandal +1
Incremental redundancy (IR) can reduce error rates by spreading coded bits across multiple transmission attempts. However, conventional stop-and-wait operation with coarse feedback…
Error Detection Based on Generalized Successive Cancellation List Decoding for Polar Codes
Alexander Sauter, Mustafa Cemil Coşkun, Gianluigi Liva
Successive cancellation list (SCL) decoding has been widely adopted for polar codes, which allows near maximum likelihood performance with sufficiently large list size. In this wor…
Precoded Polar Product Codes
Mustafa Cemil Coşkun
Precoded polar product codes are proposed, where selected component codes enable successive cancellation list decoding to generate bit-wise soft messages efficiently for iterative…
Successive Cancellation Ordered Search Decoding of Modified -Coset Codes
Peihong Yuan, Mustafa Cemil Coşkun
A tree search algorithm called successive cancellation ordered search (SCOS) is proposed for -coset codes that implements maximum-likelihood (ML) decoding with ad…
Complexity-Adaptive Maximum-Likelihood Decoding of Modified -Coset Codes
Peihong Yuan, Mustafa Cemil Coşkun
A complexity-adaptive tree search algorithm is proposed for -coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule.…
An Information-Theoretic Perspective on Successive Cancellation List Decoding and Polar Code Design
Mustafa Cemil Coşkun, Henry D. Pfister
This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement max…
Polar-Coded Non-Coherent Communication
Peihong Yuan, Mustafa Cemil Coşkun, Gerhard Kramer
A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via s…
Successive Cancellation Decoding of Single Parity-Check Product Codes: Analysis and Improved Decoding
Mustafa Cemil Coşkun, Gianluigi Liva, Alexandre Graell i Amat +2
A product code with single parity-check component codes can be described via the tools of a multi-kernel polar code, where the rows of the generator matrix are chosen according to…
Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes
Mustafa Cemil Coşkun, Joachim Neu, Henry D. Pfister
A successive cancellation (SC) decoder with inactivations is proposed as an efficient implementation of SC list (SCL) decoding over the binary erasure channel. The proposed decoder…
Ternary Quantized Polar Code Decoders: Analysis and Design
Joachim Neu, Mustafa Cemil Coşkun, Gianluigi Liva
The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This…
Successive Cancellation List Decoding of Product Codes with Reed-Muller Component Codes
Mustafa Cemil Coşkun, Thomas Jerkovits, Gianluigi Liva
This letter proposes successive cancellation list (SCL) decoding of product codes with Reed--Muller (RM) component codes. SCL decoding relies on a product code description based on…
Low-Complexity Joint Channel Estimation and List Decoding of Short Codes
Mustafa Cemil Coşkun, Gianluigi Liva, Johan Östman +1
A pilot-assisted transmission (PAT) scheme is proposed for short blocklengths, where the pilots are used only to derive an initial channel estimate for the list construction step.…
Efficient Error-Correcting Codes in the Short Blocklength Regime
Mustafa Cemil Coşkun, Giuseppe Durisi, Thomas Jerkovits +4
The design of block codes for short information blocks (e.g., a thousand or less information bits) is an open research problem that is gaining relevance thanks to emerging applicat…
Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?
Johan Östman, Giuseppe Durisi, Erik G. Ström +2
We present nonasymptotic upper and lower bounds on the maximum coding rate achievable when transmitting short packets over a Rician memoryless block-fading channel for a given requ…
Successive Cancellation Decoding of Single Parity-Check Product Codes
Mustafa Cemil Coşkun, Gianluigi Liva, Alexandre Graell i Amat +1
We introduce successive cancellation (SC) decoding of product codes (PCs) with single parity-check (SPC) component codes. Recursive formulas are derived, which resemble the SC deco…