Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

E. Uras Kargi

dblp:384/4032 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0005-6058-9560ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 2 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 67% Information theory · 33%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Storage systems · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › signal processing
channel detection
1.012026
Symbol-Level Deep Learning-Based Decoders for Concatenated Codes Over Insertion/Deletion Channels · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes
concatenated codes
1.012026
Symbol-Level Deep Learning-Based Decoders for Concatenated Codes Over Insertion/Deletion Channels · IEEE Trans. Commun. 2026
Coding theory › error-correcting codes › insertion and deletion
insertion-deletion channel
1.012026
Symbol-Level Deep Learning-Based Decoders for Concatenated Codes Over Insertion/Deletion Channels · IEEE Trans. Commun. 2026
Storage systems › storage devices › molecular data storage
DNA storage
0.312026
Symbol-Level Deep Learning-Based Decoders for Concatenated Codes Over Insertion/Deletion Channels · IEEE Trans. Commun. 2026

Methods — techniques the papers use, named apart from their topics

maximum a posteriori detection · 2.0forward-backward algorithm · 2.0deep learning · 2.0
YearPublicationVenuePosition
2026 Symbol-Level Deep Learning-Based Decoders for Concatenated Codes Over Insertion/Deletion Channels
abstract
Synchronization errors, such as insertions and deletions, pose significant challenges in communication and storage systems, including DNA data storage. Among different alternatives, serially concatenated coding schemes, where a powerful outer code is concatenated with an inner marker code, have proven effective in mitigating such errors. A common method of decoding the inner marker code is to employ the forward-backward algorithm implementing bitwise or symbolwise maximum a posteriori (MAP) detection. Recently, bit-level deep-learning based solutions have also been proposed for decoding marker codes. In this paper, we consider symbol-level deep-learning based decoders, which exploit correlations among adjacent bits to improve the decoding performance, and develop new channel detection algorithms. Unlike existing symbol-level MAP decoding approaches that can combine only two or three consecutive bits, the proposed deep-learning methods extend well beyond this limit, and achieve improved error correction performance. We also develop deep-learning based decoders for insertion/deletion channels further exacerbated by intersymbol interference, motivated by bit-patterned media recording channels and nanopore sequencing. Extensive numerical results show that the proposed symbol-level deep-learning architectures are highly effective for communication over insertion/deletion channels.
E. Uras Kargi, Tolga M. Duman
IEEE Trans. Commun.1
2024 A Deep Learning Based Decoder for Concatenated Coding Over Deletion Channels
abstract
In this paper, we introduce a deep learning-based decoder designed for concatenated coding schemes over a deletion/substitution channel. Specifically, we focus on serially concatenated codes, where the outer code is either a convolutional or a low-density parity-check (LDPC) code, and the inner code is a marker code. We utilize Bidirectional Gated Recurrent Units (BI-GRUs) as log-likelihood ratio (LLR) estimators and outer code decoders for estimating the message bits. Our results indicate that decoders powered by BI-GRUs perform comparably in terms of error rates with the MAP detection of the marker code. We also find that a single network can work well for a wide range of channel parameters. In addition, it is possible to use a single BI-GRU based network to estimate the message bits via one-shot decoding when the outer code is a convolutional code.11Code is available at https://github.com/Bilkent-CTAR-Lab/DNN-for-Deletion-Channel
E. Uras Kargi, Tolga M. Duman
ICC1