direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Es gibt keine deutsche Übersetzung dieser Webseite.

Dr. rer. nat. Igor Bjelakovic

You can find me on:

ResearchGate

Google Scholar

Most of the papers listed below and some that are not submitted yet can be found at arXiv

Preprints

M. Frey, I. Bjelakovic and S. Stanczak (2021). Over-The-Air Computation in Correlated Channels. Submitted to IEEE Transactions on Signal Processing. Final version available at arXiv:2101.04690


M. Frey, I. Bjelakovic and S. Stanczak (2020). Towards Secure Over-The-Air Computation. Submitted to IEEE Transactions on Information Forensics and Security. Preprint available at arXiv:2001.03174


Book Chapters

I. Bjelakovic, H. Boche and J. Sommerfeld (2013). Capacity Results for Arbitrarily Varying Wiretap Channels. In: Aydinian H., Cicalese F., Deppe C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg


I. Bjelakovic, H. Boche, G. Janen and J. Notzel (2013). Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities. In: Aydinian H., Cicalese F., Deppe C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol. 7777. Springer, Berlin, Heidelberg


Journal Publications

Universal quantum state merging
Zitatschlüssel Bjeuniqu2013
Autor I. Bjelakovic and H. Boche and G. Janssen
Jahr 2013
Journal Journal of Mathematical Physics, Vol. 54, 032204, https://doi.org/10.1063/1.4795243
Zusammenfassung We determine the optimal entanglement rate of quantum state merging when assuming that the state is unknown except for its membership in a certain set of states. We find that merging is possible at the lowest rate allowed by the individual states. Additionally, we establish a lower bound for the classical cost of state merging under state uncertainty. To this end we give an elementary proof for the cost in case of a perfectly known state which makes no use of the "resource framework". As applications of our main result, we determine the capacity for one-way entanglement distillation if the source is not perfectly known. Moreover, we give another achievability proof for the entanglement generation capacity over compound quantum channels.
Download Bibtex Eintrag

Conference, Symposium, and Workshop Papers

M. Frey, I. Bjelakovic and S. Stanczak (2021). Over-The-Air Computation in Correlated Channels. Accepted for publication at IEEE 2020 Information Theory Workshop (ITW), April 11-15, 2021, final version on arXiv:2101.04690


M. A. Gutierrez-Estevez, Z. Utkovski, P. Agostini, D. Schäufele, M. Frey, I. Bjelakovic and S. Stanczak (2020). Quality-of-Service prediction for physical-layer security via secrecy maps. ICASSP 2020 - 45th International Conference on Acoustics, Speech, and Signal Processing, May 4-8, 2020 in Barcelona, Spain


I. Bjelakovic, M. Frey and S. Stanczak (2019). Distributed Approximation of Functions over Fast Fading Channels with Applications to Distributed Learning and the Max-Consensus Problem. 57th Annual Allerton Conference on Communication, Control, and Computing, 24-27 Sept. 2019 in Urbana, IL, USA, arXiv:1907.03777


Z. Utkovski, P. Agostini, M. Frey, I. Bjelakovic and S. Stanczak (2019). Learning Radio Maps for Physical-Layer Security in the Radio Access. IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), 2-5 July 2019, Cannes, France


M. Frey and I. Bjelakovic and S. Stanczak (2018). Resolvability on Continuous Alphabets. IEEE International Symposium on Information Theory (ISIT), 2018, arXiv:1801.03964


M. Raceala-Motoc and S. Limmer and I. Bjelakovic and S. Stanczak (2018). Distributed Machine Learning in the Context of Function Computation over Wireless Networks. 52nd Asilomar Conference on Signals, Systems and Computers 2018, Preprint.


M. Frey and I. Bjelakovic and S. Stanczak (2017). MAC resolvability: First and second order results. 2017 IEEE Conference on Communications and Network Security (CNS), arXiv:1707.04156, 560-564.


I. Bjelakovic and J. Mohammadi and S. Stanczak (2016). Strong Secrecy and Stealth for Broadcast Channels with Confidential Messages. IEEE International Symposium on Information Theory (ISIT 2016)


I. Bjelakovic and H. Boche and J. Sommerfeld (2012). Strong Secrecy in Arbitrarily Varying Wiretap Channels. Proc. IEEE Information Theory Workshop (ITW 12), Lausanne, Switzerland


I. Bjelakovic and H. Boche and J. Sommerfeld (2011). Capacity results for compound wiretap channels. IEEE Information Theory Workshop (ITW)


Zusatzinformationen / Extras

Direktzugang:

Schnellnavigation zur Seite über Nummerneingabe

This site uses Matomo for anonymized web analytics. More information and opt-out options under data protection.

Contact

Dr. rer. nat. Igor Bjelakovic
Network and Information Theory NetIT - Faculty IV
Building HFT 400a
Einsteinufer 25
10587 Berlin
+49(0)30 314-28465