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


On the general excess bound for binary codes with covering radius one
Institution:1. School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London E1 4NS, UK;2. School of Engineering and Logistics, Charles Darwin University, Darwin NT 0909, Australia;3. Department of Computer Science, Australian National University, ACT 0200, Australia;1. Keldysh Institute for Applied Mathematics, Russian Academy of Sciences, Miusskaya sq. 4, 125047, Moscow, Russia;2. Sobolev Institute of Mathematics, Siberian Branch of Russian Academy of Sciences, Pr. Koptuyga 4, 630090, Novosibirsk, Russia;3. Budker Institute of Nuclear Physics, Siberian Branch of Russian Academy of Sciences, Pr, Lavrent''eva 11, 630090, Novosibirsk, Russia;4. Vorozhtsov Institute of Organic Chemistry, Siberian Branch of Russian Academy of Sciences, Pr. Lavrent''eva 9, 630090, Novosibirsk, Russia;1. Institute for Information Transmission Problems, Russian Academy of Sciences, Bol''shoi Karetnyi per. 19, GSP-4, Moscow, 127994, Russian Federation;2. Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Via Vanvitelli 1, Perugia, 06123, Italy;1. Department of Applied Mathematics and Physics, College of Science, Air Force Engineering University, Xi’an, Shaanxi 710051, PR China;2. Center for Combinatorics and LPMC, Nankai University, Tianjin 300071, PR China
Abstract:
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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