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


Small weight codewords in the codes arising from Desarguesian projective planes
Authors:Veerle Fack  Szabolcs L Fancsali  L Storme  Geetrui Van de Voorde  Joost Winne
Institution:1.Research Group on Combinatorial Algorithms and Algorithmic Graph Theory, Department of Applied Mathematics and Computer Science,Ghent University,Ghent,Belgium;2.Department of Computer Science,E?tv?s Loránd University,Budapest,Hungary;3.Department of Pure Mathematics and Computer Algebra,Ghent University,Ghent,Belgium
Abstract:We study codewords of small weight in the codes arising from Desarguesian projective planes. We first of all improve the results of K. Chouinard on codewords of small weight in the codes arising from PG(2, p), p prime. Chouinard characterized all the codewords up to weight 2p in these codes. Using a particular basis for this code, described by Moorhouse, we characterize all the codewords of weight up to 2p + (p−1)/2 if p ≥ 11. We then study the codes arising from $$PG(2, q=q_0^3)$$ . In particular, for q 0 = p prime, p ≥ 7, we prove that the codes have no codewords with weight in the interval q + 2, 2q − 1]. Finally, for the codes of PG(2, q), q = p h , p prime, h ≥ 4, we present a discrete spectrum for the weights of codewords with weights in the interval q + 2, 2q − 1]. In particular, we exclude all weights in the interval 3q/2, 2q − 1]. Geertrui Van de Voorde research is supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen) Joost Winne was supported by the Fund for Scientific Research - Flanders (Belgium).
Keywords:Linear codes  Projective planes  Codewords  Blocking sets
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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