DIVISIBILITY PROPERTIES AND NEW BOUNDS FOR CYCLIC CODES AND EXPONENTIAL-SUMS IN ONE AND SEVERAL VARIABLES

被引:6
|
作者
LITSYN, S
MORENO, CJ
MORENO, O
机构
[1] TEL AVIV UNIV,DEPT ELECT ENGN SYST,IL-69978 TEL AVIV,ISRAEL
[2] UNIV PUERTO RICO,DEPT MATH,RIO PIEDRAS,PR 00931
[3] CUNY,GRAD CTR,NEW YORK,NY 10560
[4] CUNY,BARUCH COLL,NEW YORK,NY 10560
关键词
BOUNDS ON THE DISTANCE OF CYCLIC CODES; DIVISIBLE CODES; EXPONENTIAL SUMS;
D O I
10.1007/BF01438279
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Serre has obtained sharp estimates for the number of rational points on an algebraic curve over a finite field. In this paper we supplement his technique with divisibility properties for exponential sums to derive new bounds for exponential sums in one and several variables. The new bounds give us an improvement on previous bounds for the minimum distance of the duals of BCH codes. The divisibility properties also imply the existence of gaps in the weight distribution of certain cyclic codes, and in particular gives us that BCH codes are divisible (in the sense of H. N. Ward).
引用
收藏
页码:105 / 116
页数:12
相关论文
共 50 条
  • [41] Shifted inverse determinant sums and new bounds for the DMT of space-time lattice codes
    Vehkalahti, Roope
    Luzzi, Laura
    Belfiore, Jean-Claude
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 2331 - 2335
  • [42] New lower and upper bounds on the expected length of optimal one-to-one codes
    Cheng, Jun
    Huang, Tien-Ke
    DCC 2006: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2006, : 43 - +
  • [43] Cyclic Constant-Weight Codes: Upper Bounds and New Optimal Constructions
    Lan, Liantao
    Chang, Yanxun
    Wang, Lidong
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2016, 62 (11) : 6328 - 6341
  • [44] Binary codes with covering radius one: Some new lower bounds
    Habsieger, L
    DISCRETE MATHEMATICS, 1997, 176 (1-3) : 115 - 130
  • [45] ON TWO NEW IDENTITIES CONCERNING THE Q-INTEGERS AND SEVERAL DIVISIBILITY PROPERTIES FOR THESE INTEGERS
    Ipek, Ahmet
    JOURNAL OF SCIENCE AND ARTS, 2023, (03): : 715 - 720
  • [46] SEVERAL NEW CLASSES OF OPTIMAL TERNARY CYCLIC CODES WITH MINIMUM DISTANCE FOUR
    Wang, Lisha
    Li, Nian
    Xu, Linjie
    Hu, Zhao
    Zeng, Xiangyong
    Nie, Liujie
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2022, 16 (04) : 1001 - 1010
  • [47] On the recursive properties of one kind hybrid power mean involving two-term exponential sums and Gauss sums
    Shen, Shimeng
    OPEN MATHEMATICS, 2018, 16 : 955 - 966
  • [48] Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
    Zeh, A.
    Ulmschneider, M.
    PROBLEMS OF INFORMATION TRANSMISSION, 2015, 51 (03) : 217 - 230
  • [49] Decoding of repeated-root cyclic codes up to new bounds on their minimum distance
    A. Zeh
    M. Ulmschneider
    Problems of Information Transmission, 2015, 51 : 217 - 230
  • [50] Binary and ternary codes of covering radius one: some new lower bounds
    Haas, W
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 161 - 178