한국정보통신학회논문지 (Journal of the Korea Institute of Information and Communication Engineering)

  • 제26권3호
  • /
  • Pages.479-482
  • /
  • 2022
  • /
  • 2234-4772(pISSN)
  • /
  • 2288-4165(eISSN)
한국정보통신학회 (The Korea Institute of Information and Commucation Engineering)
권호 표지
DOI QR코드

DOI QR Code

분산 학습으로의 적용을 위한 극소 부호의 확장 기법

Extension of Minimal Codes for Application to Distributed Learning

  • Jo, Dongsik (Department of Electrical and Computer Engineering, University of Ulsan) ;
  • Chung, Jin-Ho (Department of Electrical and Computer Engineering, University of Ulsan)
  • 투고 : 2022.01.26
  • 심사 : 2022.02.17
  • 발행 : 2022.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Recently, various artificial intelligence technologies are being applied to smart factory, finance, healthcare, and so on. When handling data requiring protection of privacy, distributed learning techniques are used. For distribution of information with privacy protection, encoding private information is required. Minimal codes has been used in such a secret-sharing scheme. In this paper, we explain the relationship between the characteristics of the minimal codes for application in distributed systems. We briefly deals with previously known construction methods, and presents extension methods for minimal codes. The new codes provide flexibility in distribution of private information. Furthermore, we discuss application scenarios for the extended codes.

키워드

과제정보

This paper was supported by Samsung Research Funding & Incubation Center of Samsung Electronics under Project Number SRFC-TB1803-03.

참고문헌

  1. Federated Learning: Collaborative Machine Learning without Centralized Training Data. https://ai.googleblog.com/2017/04/federated-learning-collaborative.html
  2. Federated Learning powered by NVIDIA Clara. https://developer.nvidia.com/blog/federated-learning-clara/
  3. J. Massey, "Minimal codewords and secret sharing," in Proc. 6th Joint Swedish-Russian Workshop on Information Theory, pp.276-279, Aug. 22-27, 1993.
  4. A. Ashikhmin and A. Barg, "Minimal Vectors in Linear Codes," IEEE Transactions on Information Theory, vol. 44, no. 5, pp. 2010-2017, Sep. 1998. https://doi.org/10.1109/18.705584
  5. C. Ding, Z. Heng and Z. Zhou, "Minimal binary linear codes," IEEE Transactions on Information Theory, vol. 64, no. 10, pp. 6536-6545, Oct. 2018. https://doi.org/10.1109/tit.2018.2819196
  6. G. Xu and L. Qu, "Three classes of minimal linear codes over the finite fields of odd characteristic," IEEE Transactions on Information Theory, vol. 65, no. 11, pp. 7067-7078, Nov. 2019. https://doi.org/10.1109/tit.2019.2918537
  7. S. Mesnager, Y. Qi, H. Ru, and C. Tan, "Minimal linear codes from characteristic functions," IEEE Transactions on Information Theory, vol. 66, no. 9, pp. 5404-5413, Sep. 2020. https://doi.org/10.1109/tit.2020.2978387
  8. G. N. Alfarano, M. Borello, and A. Neri, "A geometric characterization of minimal codes and their asymptotic performance", American Institute of Mathematical Sciences, vol. 16, no. 1. pp. 115-133, Jan. 2022. https://doi.org/10.1007/s40096-021-00398-1
  9. R. Lidl and H. Niederreiter, Finite Fields, 1st ed.; Publisher: Cambridge University Press, UK, 1997.
  10. T. K. Moon, Error Correction Coding: Mathematical Methods and Algorithms, 2nd ed.; Publisher: Wiley, US, 2021.