output
19942026
most citedObservation of the Top Quark

1.4k citations

Showing cs.ITShow all

48 papers · 1 filter

cs.IT2024★ 1 cited

Approximate Wireless Communication for Lossy Gradient Updates in IoT Federated Learning

Xiang Ma, Haijian Sun, Rose Qingyang Hu +1

Federated learning (FL) has emerged as a distributed machine learning (ML) technique that can protect local data privacy for participating clients and improve system efficiency. In…

cs.IT2020

Energy Efficient Robust Beamforming and Cooperative Jamming Design for IRS-Assisted MISO Networks

Qun Wang, Fuhui Zhou, Rose Qingyang Hu +1

Energy-efficient design and secure communications are of crucial importance in wireless communication networks. However, the energy efficiency achieved by using physical layer secu…

cs.IT2017★ 14 cited

Ultra-Reliable and Low-Latency Communications for Connected Vehicles: Challenges and Solutions

Haojun Yang, Kan Zheng, Kuan Zhang +2

With the rapid development of communications and computing, the concept of connected vehicles emerges to improve driving safety, traffic efficiency and infotainment experience. Due…

cs.IT2017★ 1 cited

Representations of the Multicast Network Problem

Sarah E. Anderson, Wael Halbawi, Nathan Kaplan +4

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of t…

cs.IT2016

Variations of the McEliece Cryptosystem

Jessalyn Bolkema, Heide Gluesing-Luerssen, Christine A. Kelley +3

Two variations of the McEliece cryptosystem are presented. The first one is based on a relaxation of the column permutation in the classical McEliece scrambling process. This is do…

cs.IT2016

Distance verification for classical and quantum LDPC codes

Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko

The techniques of distance verification known for general linear codes are re-applied to quantum stabilizer codes. Then distance verification is addressed for classical and quantum…

cs.IT2016★ 1 cited

Distance verification for LDPC codes

Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko

The problem of finding code distance has been long studied for the generic ensembles of linear codes and led to several algorithms that substantially reduce exponential complexity…

cs.IT2015★ 1 cited

Matched Metrics and Channels

Marcelo Firer, Judy L. Walker

The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with neare…

cs.IT2012★ 3 cited

Geometric WOM codes and coding strategies for multilevel flash memories

Kathryn Haymaker, Christine A. Kelley

This paper investigates the design and application of write-once memory (WOM) codes for flash memory storage. Using ideas from Merkx ('84), we present a construction of WOM codes b…

cs.IT2011

Effective Capacity of Two-Hop Wireless Communication Systems

Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar

A two-hop wireless communication link in which a source sends data to a destination with the aid of an intermediate relay node is studied. It is assumed that there is no direct lin…

cs.IT2010

On the Effective Capacity of Two-Hop Communication Systems

Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar

In this paper, two-hop communication between a source and a destination with the aid of an intermediate relay node is considered. Both the source and intermediate relay node are as…

cs.IT2010

Transmission Strategies in Multiple Access Fading Channels with Statistical QoS Constraints

Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multi…

cs.IT2010

Throughput Analysis of Buffer-Constrained Wireless Systems in the Finite Blocklength Regime

Mustafa Cenk Gursoy

In this paper, wireless systems operating under queueing constraints in the form of limitations on the buffer violation probabilities are considered. The throughput under such cons…

cs.IT2010★ 1 cited

Goodput Maximization in Cooperative Networks with ARQ

Qing Chen, Mustafa Cenk Gursoy

In this paper, the average successful throughput, i.e., goodput, of a coded 3-node cooperative network is studied in a Rayleigh fading environment. It is assumed that a simple auto…

cs.IT2010★ 5 cited

Collaborative Relay Beamforming for Secrecy

Junwei Zhang, Mustafa Cenk Gursoy

In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, decode-and-forward (DF) and amplify-and-…

cs.IT2010

Algebraic Constructions of Graph-Based Nested Codes from Protographs

Christine A. Kelley, Joerg Kliewer

Nested codes have been employed in a large number of communication applications as a specific case of superposition codes, for example to implement binning schemes in the presence…

cs.IT2010★ 1 cited

Performance Analysis of Cognitive Radio Systems under QoS Constraints and Channel Uncertainty

Sami Akin, Mustafa Cenk Gursoy

In this paper, performance of cognitive transmission over time-selective flat fading channels is studied under quality of service (QoS) constraints and channel uncertainty. Cogniti…

cs.IT2010★ 1 cited

Ergodic Capacity Analysis in Cognitive Radio Systems under Channel Uncertainty

Sami Akin, Mustafa Cenk Gursoy

In this paper, pilot-symbol-assisted transmission in cognitive radio systems over time selective flat fading channels is studied. It is assumed that causal and noncausal Wiener fil…

cs.IT2010

QoS Analysis of Cognitive Radio Channels with Perfect CSI at both Receiver and Transmitter

Sami Akin, Mustafa Cenk Gursoy

In this paper, cognitive transmission under quality of service (QoS) constraints is studied. In the cognitive radio channel model, it is assumed that both the secondary receiver an…

cs.IT2010★ 5 cited

Relay Beamforming Strategies for Physical-Layer Security

Junwei Zhang, Mustafa Cenk Gursoy

In this paper, collaborative use of relays to form a beamforming system and provide physical-layer security is investigated. In particular, amplify-and-forward (AF) relay beamformi…

cs.IT2010★ 43 cited

Energy Efficiency Analysis in Amplify-and-Forward and Decode-and-Forward Cooperative Networks

Qing Chen, Mustafa Cenk Gursoy

In this paper, we have studied the energy efficiency of cooperative networks operating in either the fixed Amplifyand- Forward (AF) or the selective Decode-and-Forward (DF) mode. W…

cs.IT2010

Secure Broadcasting over Fading Channels with Statistical QoS Constraints

Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar

In this paper, the fading broadcast channel with confidential messages is studied in the presence of statistical quality of service (QoS) constraints in the form of limitations on…

cs.IT2009

On the Achievable Throughput Region of Multiple-Access Fading Channels with QoS Constraints

Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar

Effective capacity, which provides the maximum constant arrival rate that a given service process can support while satisfying statistical delay constraints, is analyzed in a multi…

cs.IT2009★ 1 cited

Energy Efficiency in the Low-SNR Regime under Queueing Constraints and Channel Uncertainty

Deli Qiao, Mustafa Cenk Gursoy, Senem Velipasalar

Energy efficiency of fixed-rate transmissions is studied in the presence of queueing constraints and channel uncertainty. It is assumed that neither the transmitter nor the receive…