Onur Ozan Koyluoglu

According to our database1, Onur Ozan Koyluoglu authored at least 73 papers between 2007 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
BEAR: Sketching BFGS Algorithm for Ultra-High Dimensional Feature Selection in Sublinear Memory.
CoRR, 2020

FastSecAgg: Scalable Secure Aggregation for Privacy-Preserving Federated Learning.
CoRR, 2020

Communication-Efficient Gradient Coding for Straggler Mitigation in Distributed Learning.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Vulnerabilities of Massive MIMO Systems to Pilot Contamination Attacks.
IEEE Trans. Inf. Forensics Secur., 2019

On the Organization of Grid and Place Cells: Neural Denoising via Subspace Learning.
Neural Comput., 2019

Secrecy over Multiple-Access Channel: A Game of Competition and Cooperation.
J. Univers. Comput. Sci., 2019

On an Equivalence Between Single-Server PIR with Side Information and Locally Recoverable Codes.
Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Gradient Coding Based on Block Designs for Mitigating Adversarial Stragglers.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing.
IEEE Trans. Inf. Theory, 2018

Collective Secrecy Over the K-Transmitter Multiple Access Channel.
IEEE Trans. Inf. Forensics Secur., 2018

The impact of encoding-decoding schemes and weight normalization in spiking neural networks.
Neural Networks, 2018

Architecture-aware coding for distributed storage: Repairable block failure resilient codes.
Adv. Math. Commun., 2018

2017
Individual Secrecy for the Broadcast Channel.
IEEE Trans. Inf. Theory, 2017

Individual Secrecy for Broadcast Channels With Receiver Side Information.
IEEE Trans. Inf. Theory, 2017

Exploiting Full-Duplex Receivers for Achieving Secret Communications in Multiuser MISO Networks.
IEEE Trans. Commun., 2017

A General Construction for PMDS Codes.
IEEE Commun. Lett., 2017

On the organization of grid and place cells: Neural de-noising via subspace learning.
CoRR, 2017

Vulnerabilities of Massive MIMO Systems Against Pilot Contamination Attacks.
CoRR, 2017

Repair Strategies for Storage on Mobile Clouds.
CoRR, 2017

Joint secrecy over the K-transmitter multiple access channel.
Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Secure regenerating codes for hybrid cloud storage systems.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Pilot contamination attacks in massive MIMO systems.
Proceedings of the 2017 IEEE Conference on Communications and Network Security, 2017

Efficient data access in hybrid cloud storage.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
State Amplification Subject to Masking Constraints.
IEEE Trans. Inf. Theory, 2016

Multi-periodic neural coding for adaptive information transfer.
Theor. Comput. Sci., 2016

Hierarchical Polar Coding for Achieving Secrecy Over State-Dependent Wiretap Channels Without Any Instantaneous CSI.
IEEE Trans. Commun., 2016

Progress on high-rate MSR codes: Enabling arbitrary number of helper nodes.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

On secure communication over the multiple access channel.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

On the maintenance of distributed storage systems with backup node for repair.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Centralized repair of multiple node failures.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Threshold-Based File Maintenance Strategies for Mobile Cloud Storage Systems.
Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015
Hierarchical Polar Coding for Achieving Secrecy over Fading Wiretap Channels without any Instantaneous CSI.
CoRR, 2015

Expansion Coding for Channel and Source Coding.
CoRR, 2015

Achieving secrecy without any instantaneous CSI: polar coding for fading wiretap channels.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the individual secrecy rate region for the broadcast channel with an external eavesdropper.
Proceedings of the IEEE International Symposium on Information Theory, 2015

On the individual secrecy for Gaussian broadcast channels with receiver side information.
Proceedings of the IEEE International Conference on Communication, 2015

Receiver-Based Friendly Jamming with Single-Antenna Full-Duplex Receivers in a Multiuser Broadcast Channel.
Proceedings of the 2015 IEEE Global Communications Conference, 2015

2014
Secure Cooperative Regenerating Codes for Distributed Storage Systems.
IEEE Trans. Inf. Theory, 2014

Polar Coding for Fading Channels: Binary and Exponential Channel Cases.
IEEE Trans. Commun., 2014

Lossy compression of exponential and laplacian sources using expansion coding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the achievable individual-secrecy rate region for broadcast channels with receiver side information.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Repairable Block Failure Resilient codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Secure distributed storage systems: Local repair with minimum bandwidth regeneration.
Proceedings of the 6th International Symposium on Communications, 2014

2013
Achievable Secrecy Rate Regions for the Two-Way Wiretap Channel.
IEEE Trans. Inf. Theory, 2013

Opportunistic Secrecy with a Strict Delay Constraint.
IEEE Trans. Commun., 2013

Polar coding for fading channels.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Optimal locally repairable codes with local minimum storage regeneration via rank-metric codes.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Optimal locally repairable codes via rank-metric codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Secure locally repairable codes for distributed storage systems.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

The secrecy capacity of minimum bandwidth cooperative regenerating codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Explicit MBR all-symbol locality codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
On Secrecy Capacity Scaling in Wireless Networks.
IEEE Trans. Inf. Theory, 2012

Polar Coding for Secure Transmission and Key Agreement.
IEEE Trans. Inf. Forensics Secur., 2012

Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
CoRR, 2012

Resource allocation for throughput enhancement in cellular shared relay networks.
Proceedings of the 35th IEEE Sarnoff Symposium 2012, Newark, NJ, USA, May 21-22, 2012, 2012

Expansion coding: Achieving the capacity of an AEN channel.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Dynamic shift-map coding with side information at the decoder.
Proceedings of the 50th Annual Allerton Conference on Communication, 2012

2011
Interference Alignment for Secrecy.
IEEE Trans. Inf. Theory, 2011

Cooperative Encoding for Secrecy in Interference Channels.
IEEE Trans. Inf. Theory, 2011

Joint interference cancellation and dirty paper coding for cognitive cellular networks.
Proceedings of the 2011 IEEE Wireless Communications and Networking Conference, 2011

On the degrees of freedom of the cognitive broadcast channel.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Proactive source coding.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

State amplification under masking constraints.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Polar alignment for interference networks.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
The Two Way Wiretap Channel: Theory and Practice
CoRR, 2010

Secrecy games over the cognitive channel.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
On power control and frequency reuse in the two user cognitive channel.
IEEE Trans. Wirel. Commun., 2009

Cooperative Binning and Channel Prefixing for Secrecy in Interference Channels
CoRR, 2009

A new achievable rate region for the discrete memoryless X channel.
Proceedings of the IEEE International Symposium on Information Theory, 2009

On the delay limited secrecy capacity of fading channels.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
On the secrecy rate region for the interference channel.
Proceedings of the IEEE 19th International Symposium on Personal, 2008

On the secure degrees of freedom in the K-user Gaussian interference channel.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
On the Utility of Frequency Reuse in Cognitive Radio Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2007


  Loading...