24 citations to https://www.mathnet.ru/rus/fpm1423
  1. Nasim Abdi Kourani, Hassan Khodaiemehr, Mohammad Javad Nikmehr, “Locally Recoverable Codes Over Z p
    s”, IEEE Trans. Commun., 72:5 (2024), 2503  crossref
  2. Piotr Mitosek, “Pauli Flow on Open Graphs with Unknown Measurement Labels”, Electron. Proc. Theor. Comput. Sci., 406 (2024), 117  crossref
  3. Ismail Assoujaa, Siham Ezzouak, Proceedings of the 7th International Conference on Networking, Intelligent Systems and Security, 2024, 1  crossref
  4. Weiqi Li, Zhiying Wang, Taiting Lu, Hamid Jafarkhani, “Storage Codes With Flexible Number of Nodes”, IEEE Trans. Inform. Theory, 69:1 (2023), 561  crossref
  5. Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman, “Nearly Optimal Pseudorandomness from Hardness”, J. ACM, 69:6 (2022), 1  crossref
  6. Jing Zhang, Ya-Juan Yang, Yi-Peng Li, Xingsi Xue, “A New Key Exchange Protocol Based on Infinite Non-Abelian Groups”, Security and Communication Networks, 2022 (2022), 1  crossref
  7. S. B. Balaji, Myna Vajha, P. Vijay Kumar, “Lower Bounds on the Sub-Packetization Level of MSR Codes and Characterizing Optimal-Access MSR Codes Achieving the Bound”, IEEE Trans. Inform. Theory, 68:10 (2022), 6452  crossref
  8. Ismail Assoujaa, Siham Ezzouak, Hakima Mouanis, Communications in Computer and Information Science, 1747, Cryptography, Codes and Cyber Security, 2022, 104  crossref
  9. Weiqi Li, Zhen Chen, Zhiying Wang, Syed A. Jafar, Hamid Jafarkhani, “Flexible Distributed Matrix Multiplication”, IEEE Trans. Inform. Theory, 68:11 (2022), 7500  crossref
  10. Mahdi Cheraghchi, Shuichi Hirahara, Dimitrios Myrisiotis, Yuichi Yoshida, “One-Tape Turing Machine and Branching Program Lower Bounds for MCSP”, Theory Comput Syst, 2022  crossref
1
2
3
Следующая