activity
20242026
most citedA Deep Learning Based Decoder for Concatenated Coding over Deletion Channels

4 citations · 12 across the 20 of their papers we have counts for

collaborators

23 papers

cs.IT2026

The Coverage Depth Problem in Distributed DNA Data Storage

Xiangliang Kong, Ohad Elishco, Chen Wang +1

Random sampling in DNA sequencing produces repeated reads, increasing retrieval latency and sequencing cost. We study the coverage-depth problem for full-message recovery in distri…

cs.IT2026

Improved Lower Bounds on the Capacity of the Binary Deletion Channel via a Learning Approach to Run-Length Inputs

Hassan Khodaiemehr, Chen Feng, Tolga M. Duman

The best constructive lower bounds on the capacity of the binary deletion channel come from random codes with independent run lengths, yet the two strongest such bounds, due to Dri…

cs.IT2026

One Burst of t-Deletion and One Burst of t-Substitution Error-Correcting Codes

Yajuan Liu, Han Cai, Tolga M. Duman

Synchronization errors, including insertions, deletions, and substitutions, may occur in bursts in communication systems such as DNA data storage, file synchronization, and magneti…

cs.LG2026

Cluster-Aware Over-the-Air Federated Learning with Energy-Harvesting Devices: From Global Training to Model Personalization

Furkan Bagci, Busra Tegin, Mohammad Kazemi +1

Federated learning (FL) enables distributed optimization and learning across decentralized edge devices while preserving data privacy, but its performance is fundamentally constrai…

cs.IT2026

Bounds on Multiple -Burst Deletion-Correcting Codes

Chen Wang, Xiangliang Kong, Eitan Yaakobi +1

Motivated by their applications in DNA-based storage systems, codes capable of correcting consecutive deletions have attracted significant attention. An important class of such cod…

cs.IT2026

Learning-Enhanced Composite DNA Data Storage Under Sampling Randomness and IDS Errors

Busra Tegin, Tolga M Duman

DNA data storage offers a high-density, long-term alternative to conventional storage systems, addressing the exponential growth of digital data. Composite DNA extends this paradig…

cs.IT2026★ 1 cited

Error-Correcting Codes for Two Bursts of t1-Deletion-t2-Insertion with Reduced Complexity

Yajuan Liu, Tolga M. Duman

Burst errors involving simultaneous insertions, deletions, and substitutions occur in practical scenarios, including DNA data storage and document synchronization, motivating the d…

cs.IT2025

Communication via Sensing

Mohammad Kazemi, Tolga M. Duman, Deniz Gündüz

We present an alternative take on the recently popularized concept of `\textit{joint sensing and communications}', which focuses on using communication resources also for sensing.…

cs.IT2025

Error Correcting Codes for Segmented Burst-Deletion Channels

Yajuan Liu, Tolga M. Duman

We study segmented burst-deletion channels motivated by the observation that synchronization errors commonly occur in a bursty manner in real-world settings. In this channel model,…

cs.IT2025

Half-Marker Codes for Deletion Channels with Applications in DNA Storage

Javad Haghighat, Tolga M. Duman

DNA storage systems face significant challenges, including insertion, deletion, and substitution (IDS) errors. Therefore, designing effective synchronization codes, i.e., codes cap…

cs.IT2025

On the Capacity of Insertion Channels for Small Insertion Probabilities

Busra Tegin, Tolga M Duman

Channels with synchronization errors, such as deletion and insertion errors, are crucial in DNA storage, data reconstruction, and other applications. These errors introduce memory…

cs.IT2025

Constrained Error-Correcting Codes for Efficient DNA Synthesis

Yajuan Liu, Tolga M. Duman

DNA synthesis is considered as one of the most expensive components in current DNA storage systems. In this paper, focusing on a common synthesis machine, which generates multiple…

cs.IT2025

Simple Finite-Length Achievability and Converse Bounds for the Deletion Channel and the Insertion Channel

Ruslan Morozov, Tolga Mete Duman

We develop upper bounds on code size for an independent and identically distributed deletion and insertion channels for a given code length and target frame error probability. The…

cs.IT2025

Characterization of Deletion/Substitution Channel Capacity for Small Deletion and Substitution Probabilities

Mohammad Kazemi, Tolga M. Duman

We consider binary input deletion/substitution channels, which model certain types of synchronization errors encountered in practice. Specifically, we focus on the regime of small…

cs.LG2025

Update Estimation and Scheduling for Over-the-Air Federated Learning with Energy Harvesting Devices

Furkan Bagci, Busra Tegin, Mohammad Kazemi +1

We study over-the-air (OTA) federated learning (FL) for energy harvesting devices with heterogeneous data distribution over wireless fading multiple access channel (MAC). To addres…

cs.LG2025

Over-the-Air Multi-Sensor Inference with Neural Networks Using Memristor-Based Analog Computing

Busra Tegin, Muhammad Atif Ali, Tolga M Duman

Deep neural networks provide reliable solutions for many classification and regression tasks; however, their application in real-time wireless systems with simple sensor networks i…

cs.IT2024

Capacity Approximations for Insertion Channels with Small Insertion Probabilities

Busra Tegin, Tolga M Duman

Channels with synchronization errors, exhibiting deletion and insertion errors, find practical applications in DNA storage, data reconstruction, and various other domains. Presence…

cs.IT2024★ 4 cited

A Deep Learning Based Decoder for Concatenated Coding over Deletion Channels

E. Uras Kargı, Tolga M. Duman

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 concaten…

cs.IT2024★ 4 cited

A Practical Concatenated Coding Scheme for Noisy Shuffling Channels with Coset-based Indexing

Javad Haghighat, Tolga M. Duman

Noisy shuffling channels capture the main characteristics of DNA storage systems where distinct segments of data are received out of order, after being corrupted by substitution er…

cs.IT2024

Unsourced Random Access: A Comprehensive Survey

Mert Ozates, Mohammad Javad Ahmadi, Mohammad Kazemi +2

Multiple access communication systems enable numerous users to share common communication resources, playing a crucial role in wireless networks. With the emergence of the sixth ge…

cs.IT2024

RIS-Aided Unsourced Multiple Access (RISUMA): Coding Strategy and Performance Limits

Mohammad Javad Ahmadi, Mohammad Kazemi, Tolga M. Duman

This paper considers an unsourced random access (URA) set-up equipped with a passive reconfigurable intelligent surface (RIS), where a massive number of unidentified users (only a…

cs.IT2024

An ODMA-Based Unsourced Random Access Scheme with a Multiple Antenna Receiver

Mert Ozates, Mohammad Kazemi, Tolga M. Duman

We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-divisio…

cs.IT2024★ 3 cited

Next Generation Advanced Transceiver Technologies for 6G and Beyond

Changsheng You, Yunlong Cai, Yuanwei Liu +4

To accommodate new applications such as extended reality, fully autonomous vehicular networks and the metaverse, next generation wireless networks are going to be subject to much m…