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


MDS and I-perfect poset block codes
Affiliation:1. Department of Mathematics, University of Delhi, Delhi, 110 007, India;2. Mata Sundri College for Women, University of Delhi, Mata Sundri Lane, Delhi, 110 002, India;1. Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China;2. PCL Research Center of Networks and Communications, Peng Cheng Laboratory, Shenzhen 518055, China;3. Chern Institute of Mathematics and LPMC, Nankai University, Tianjin 300071, China;4. Tianjin Key Laboratory of Network and Data Security Technology, Nankai University, Tianjin 300071, China;1. Technology Innovation Institute, Abu Dhabi, United Arab Emirates;2. Università degli Studi di Torino, Dipartimento di Matematica, Via Carlo Alberto 10, 10123 Torino, Italy;1. KTH Royal Institute of Technology, Sweden;2. Gran Sasso Science Institute (IT) and Department of Informatics, University of Leicester, UK;1. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Italy;2. Dipartimento di Matematica, Informatica ed Economia, Università degli Studi della Basilicata, Italy
Abstract:
Keywords:Maximum distance separable code  Poset block metric  Perfect code
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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