activity
20182026
most citedGaussian Multiple and Random Access in the Finite Blocklength Regime

34 citations · 78 across the 10 of their papers we have counts for

collaborators

13 papers

cs.IT2026

A Tight Second-Order Converse Bound for Variable-Length Feedback Codes

Recep Can Yavas

We study variable-length feedback (VLF) codes over a discrete memoryless channel under average decoding-time and error-probability constraints. In the non-vanishing error probabili…

cs.IT2026

Posterior Matching over Binary-Input Memoryless Symmetric Channels: Non-Asymptotic Bounds and Low-Complexity Encoding

Recep Can Yavas

We study variable-length feedback (VLF) codes over binary-input memoryless symmetric (BMS) channels using posterior matching with small-enough-difference (SED) partitioning. Prior…

cs.LG2024★ 4 cited

A General Framework for Clustering and Distribution Matching with Bandit Feedback

Recep Can Yavas, Yuqi Huang, Vincent Y. F. Tan +1

We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a -armed bandit model where some subset of arms is partiti…

cs.IT2024

Variable-Length Feedback Codes over Known and Unknown Channels with Non-vanishing Error Probabilities

Recep Can Yavas, Vincent Y. F. Tan

We study variable-length feedback (VLF) codes with noiseless feedback for discrete memoryless channels. We present a novel non-asymptotic bound, which analyzes the average error pr…

cs.LG2023

Fixed-Budget Best-Arm Identification in Sparse Linear Bandits

Recep Can Yavas, Vincent Y. F. Tan

We study the best-arm identification problem in sparse linear bandits under the fixed-budget setting. In sparse linear bandits, the unknown feature vector may be of large dim…

cs.IT2023

Variable-Length Codes with Bursty Feedback

James Y. Chen, Recep Can Yavas, Victoria Kostina

We study variable-length codes for point-to-point discrete memoryless channels with noiseless unlimited-rate feedback that occurs in bursts. We term such codes variable-length…

cs.IT2022

Incremental Redundancy With ACK/NACK Feedback at a Few Optimal Decoding Times

Hengjie Yang, Recep Can Yavas, Victoria Kostina +1

Incremental redundancy with ACK/NACK feedback produces a variable-length stop-feedback (VLSF) code constrained to have decoding times, with an ACK/NACK feedback to the transmit…

cs.IT2022

Third-order Analysis of Channel Coding in the Small-to-Moderate Deviations Regime

Recep Can Yavas, Victoria Kostina, Michelle Effros

This paper studies the third-order characteristic of nonsingular discrete memoryless channels and the Gaussian channel with a maximal-power constraint. The third-order term in our…

cs.IT2022

Variable-Length Stop-Feedback Codes With Finite Optimal Decoding Times for BI-AWGN Channels

Hengjie Yang, Recep Can Yavas, Victoria Kostina +1

In this paper, we are interested in the performance of a variable-length stop-feedback (VLSF) code with optimal decoding times for the binary-input additive white Gaussian nois…

cs.IT2021★ 11 cited

Variable-Length Sparse Feedback Codes for Point-to-Point, Multiple Access, and Random Access Channels

Recep Can Yavas, Victoria Kostina, Michelle Effros

This paper investigates variable-length stop-feedback codes for memoryless channels in point-to-point, multiple access, and random access communication scenarios. The proposed code…

cs.IT2020

Third-Order Asymptotics of Variable-Length Compression Allowing Errors

Yuta Sakai, Recep Can Yavas, Vincent Y. F. Tan

This study investigates the fundamental limits of variable-length compression in which prefix-free constraints are not imposed (i.e., one-to-one codes are studied) and non-vanishin…

cs.IT2020★ 34 cited

Gaussian Multiple and Random Access in the Finite Blocklength Regime

Recep Can Yavas, Victoria Kostina, Michelle Effros

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power con…

cs.IT2018★ 29 cited

Random Access Channel Coding in the Finite Blocklength Regime

Recep Can Yavas, Victoria Kostina, Michelle Effros

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy…