direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Dr. rer. nat. Igor Bjelakovic

You can find me on:

ResearchGate [1]

Google Scholar [2]

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

Preprints

M. Frey, I. Bjelakovic and S. Stanczak (2020). Towards Secure Over-The-Air Computation [4]. Submitted to Problems of Information Transmission. Preprint available at arXiv:2001.03174


I. Bjelakovic and R. Siegmund-Schultze (2015). Quantum Stein's lemma revisited, inequalities for quantum entropies, and a concavity theorem of Lieb [5]. Preprint available at arXiv:quant-ph/0307170


Book Chapters

I. Bjelakovic and H. Boche and J. Sommerfeld (2013). Capacity Results for Arbitrarily Varying Wiretap Channels [6]. 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 and H. Boche and G. Janen and J. Notzel (2013). Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities [7]. 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
Citation key Bjeuniqu2013
Author I. Bjelakovic and H. Boche and G. Janssen
Year 2013
Journal Journal of Mathematical Physics, Vol. 54, 032204, https://doi.org/10.1063/1.4795243
Abstract 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 entry [8]

Conference, Symposium, and Workshop Papers

next >> [13]

Hernang√≥mez, Rodrigo and Bjelakovic, Igor and Servadei, Lorenzo and Sta'nczak, Sławomir (2022). Unsupervised Domain Adaptation across FMCW Radar Configurations Using Margin Disparity Discrepancy [14]. 2022 30th European Signal Processing Conference (EUSIPCO)


M. Frey, I. Bjelakovic and S. Stanczak (2021). Over-The-Air Computation in Correlated Channels [15]. IEEE 2020 Information Theory Workshop (ITW), April 11-15, 2021


Frey, Matthias and Bjelakovic, Igor and Stanczak, Slawomir (2021). Towards secure over-the-air computation [16]. 2021 IEEE International Symposium on Information Theory (ISIT), 700–705.


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


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


Z. Utkovski and P. Agostini and M. Frey and I. Bjelakovic, and S. Stanczak (2019). Learning radio maps for physical-layer security in the radio access [19]. IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC), Cannes, France, July 2-5 2019. (invited)


Z. Utkovski and P. Agostini and M. Frey and I. Bjelakovic and S. Stanczak (2019). Learning Radio Maps for Physical-Layer Security in the Radio Access [20]. 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 [21]. 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 [22]. 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 [23]. 2017 IEEE Conference on Communications and Network Security (CNS), arXiv:1707.04156, 560-564.


next >> [27]

This site uses Matomo [28] 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
Contact [29]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

Copyright TU Berlin 2008