首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Singleton-optimal LRCs and perfect LRCs via cyclic and constacyclic codes
Institution:1. Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Qingdao, 266237, China;2. School of Cyber Science and Technology, Shandong University, Qingdao, 266237, China;3. Quancheng Laboratory, Jinan, 250103, China;4. Chern Institute of Mathematics and LPMC, Nankai University, Tianjin, 300071, China;5. Department of Computer Science and Technology, Harbin Institute of Technology, Shenzhen, 518055, China;6. Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen, 518055, China;1. Department of Mathematics, University of Kaiserslautern, Kaiserslautern, Germany;2. Department of Mathematics: Analysis, Logic and Discrete Mathematics, Ghent University, Ghent, Belgium;1. Department of Mathematics, Technion - Israel Institute of Technology, Haifa, Israel;2. Department of Mathematics and Computer Science, The Open University of Israel, Israel
Abstract:
Keywords:Locally repairable codes  Singleton-optimal LRCs  Perfect LRCs  Cyclic codes  Constacyclic codes
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号