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


3-Designs from the Z 4-Goethals Codes via a New Kloosterman Sum Identity
Authors:Dong-Joon Shin  P. Vijay Kumar  Tor Helleseth
Affiliation:(1) Division of Electrical and Computer Engineering, Hanyang University, 17 Haengdang Dong, Seong-Dong Gu, Seoul, 133-791, Korea;(2) Communication Sciences Institute, EE-Systems, University of Southern California, Los Angeles, CA 90089-2565, USA;(3) Department of Informatics, University of Bergen, HIB N-5020 Bergen, Norway
Abstract:Recently, active research has been performed on constructing t-designs from linear codes over Z4. In this paper, we will construct a new simple 3 – (2m, 7, 14/3 (2m – 8)) design from codewords of Hamming weight 7 in the Z4-Goethals code for odd m ge 5. For 3 arbitrary positions, we will count the number of codewords of Hamming weight 7 whose support includes those 3 positions. This counting can be simplified by using the double-transitivity of the Goethals code and divided into small cases. It turns out interestingly that, in almost all cases, this count is related to the value of a Kloosterman sum. As a result, we can also prove a new Kloosterman sum identity while deriving the 3-design.
Keywords:t-designs  Z4-Goethals codes  Kloosterman sums
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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