2-WEIGHT PROJECTIVE CODES - COMPLETE CAPS AND DIFFERENCE SETS

被引:15
|
作者
WOLFMANN, J [1 ]
机构
[1] CTR UNIV TOULON,UER,SCI TECH,83130 LA GARDE,FRANCE
关键词
D O I
10.1016/0097-3165(77)90042-5
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
引用
收藏
页码:208 / 222
页数:15
相关论文
共 50 条
  • [21] Two classes of 2-weight and 3-weight linear codes in terms of Kloosterman sums
    Quan, Xiaoshan
    Yue, Qin
    Li, Xia
    Li, Chengju
    [J]. CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2023, 15 (02): : 365 - 380
  • [22] A construction of small complete caps in projective spaces
    Bartoli D.
    Faina G.
    Marcugini S.
    Pambianco F.
    [J]. Journal of Geometry, 2017, 108 (1) : 215 - 246
  • [23] Digraphs are 2-weight choosable
    Khatirinejad, Mahdad
    Naserasr, Reza
    Newman, Mike
    Seamone, Ben
    Stevens, Brett
    [J]. ELECTRONIC JOURNAL OF COMBINATORICS, 2011, 18 (01):
  • [24] Difference sets and three-weight linear codes from trinomials
    Ahmadi, Omran
    Shafaeiabr, Masoud
    [J]. FINITE FIELDS AND THEIR APPLICATIONS, 2023, 89
  • [25] Constructions of Small Complete Caps in Binary Projective Spaces
    Alexander A. Davydov
    Giorgio Faina
    Fernanda Pambianco
    [J]. Designs, Codes and Cryptography, 2005, 37 : 61 - 80
  • [26] Constructions of small complete caps in binary projective spaces
    Davydov, AA
    Faina, G
    Pambianco, F
    [J]. DESIGNS CODES AND CRYPTOGRAPHY, 2005, 37 (01) : 61 - 80
  • [27] Complete caps in projective spaces PG(n, q)
    Davydov A.A.
    Marcugini S.
    Pambianco F.
    [J]. Journal of Geometry, 2004, 80 (1-2) : 23 - 30
  • [28] Long binary linear codes and large caps in projective space
    [J]. Des Codes Cryptography, 1-3 (37-60):
  • [29] A NOTE ON SMALL WEIGHT CODEWORDS OF PROJECTIVE GEOMETRIC CODES AND ON THE SMALLEST SETS OF EVEN TYPE
    Adriaensen, Sam
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (03) : 2072 - 2087
  • [30] ON S-SUM-SETS (S ODD) AND 3-WEIGHT PROJECTIVE CODES
    GRIERA, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1988, 307 : 68 - 76