R3中卯形闭曲面的等周亏格的上界的注记

利用R^3中卵形结果的高斯曲率不等式以及著名的等周不等式,将R^3中卵形闭曲面的高斯曲率K应用到空间曲面的等周亏格的上界估计中,得到了R^3中卵形闭曲面的等周亏格的一个新的上界,并给出其简单证明．     

平面凸体的等周亏格的上界估计

本文研究平面凸体的等周亏格的上界估计.利用文献[20]中的思想得到一些新的由凸体的周长、面积、最小外接圆半径和最大内切圆半径表示的等周亏格的上界估计,推广了文献[20]中的结果.     

关于R3中卵形区域的等周亏格的上界估计的注记

本文研究了空间曲面的等周亏格问题.利用R3中卵形区域的高斯曲率K及著名的等周小等式,得到R3中卵形区域的等周亏格的几个上界估计.     

关于平面卵形区域的等周亏格上界的几点注记

利用平面卵形区域的Ros'定理及其加强形式,给出平面R²中卵形区域的等周亏格的几个上界估计.     

两平面凸域的对称混合等周不等式

设K_k(k=i,j)为欧氏平面R~2中面积为A_k,周长为P_k的域,它们的对称混合等周亏格(symmetric mixed isoperimetric deficit)为σ(K_i,K_j)=P_i~2P_j~2-16π~2A_iA_j.根据周家足,任德麟(2010)和Zhou,Yue(2009)中的思想,用积分几何方法,得到了两平面凸域的Bonnesen型对称混合不等式及对称混合等周不等式,给出了两域的对称混合等周亏格的一个上界估计.还得到了两平面凸域的离散Bonnesen型对称混合不等式及两凸域的对称混合等周亏格的一个上界估计,并应用这些对称混合(等周)不等式估计第二类完全椭圆积分.     

半线性椭圆方程正解的等周不等式

证明了一类半线性椭圆方程正解满足等周不等式,并得到了此解的最佳上界估计.     

混合边值条件下Laplace方程的等谱问题以及分形鼓

本文将首先在R^2和R^3中各自构造出一对混合边值条件的等谱非等距同构的基本构件。并且在R^2中利用自相似的方法构造出相应的等谱非等距同构分形鼓．在此基础上，本文讨论了这类分形鼓的波数目函数的渐近估计．得到其第二项系数的上界和下界估计。     

有限域上一类等维码的下界

等维码凭借其在随机线性网络编码中的良好的差错控制得到广泛研究,对于给定维数和最小距离的等维码所含码字的最大个数目前还没有一般性结果.Tuvi Etzion和Alexander Vardy给出了一定等维码所含码字最大个数的上界和下界,首先利用对偶空间构造等维码C(n,M,2k,k),达到了此类码所含码字的下界,然后具体构造了最优等维码C(7,41,4,2).     

$p$-双调和算子的第一特征值的等周上界和 Reilly 型不等式

在本文中,我们给出了嵌入到欧氏空间中的$n$维闭超曲面上$p$-双调和算子的第一特征值的一些等周上界.我们也给出了浸入到高维流形如欧氏空间,球面和射影空间中的闭子流形上$p$-双调和算子的第一特征值的一些Reilly-型不等式.     

随机服务系统中的首达时间(Ⅱ)

我们在[1]中引进了随机服务系统的首达上界时间与首达下界时间的概念。所谓首达上界时间，是指系统由初始时刻开始到它的队长首次达到某一预定的上界为止，所需的     

Undetected error probability of q-ary constant weight codes

In this paper, we introduce a new combinatorial invariant called q-binomial moment for q-ary constant weight codes. We derive a lower bound on the q-binomial moments and introduce a new combinatorial structure called generalized (s, t)-designs which could achieve the lower bounds. Moreover, we employ the q-binomial moments to study the undetected error probability of q-ary constant weight codes. A lower bound on the undetected error probability for q-ary constant weight codes is obtained. This lower bound extends and unifies the related results of Abdel-Ghaffar for q-ary codes and Xia-Fu-Ling for binary constant weight codes. Finally, some q-ary constant weight codes which achieve the lower bounds are found.      

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

The characterization of binary constant weight codes meeting the bound of Fu and Shen

Fu and Shen gave an upper bound on binary constant weight codes. In this paper, we present a new proof for the bound of Fu and Shen and characterize binary constant weight codes meeting this bound. It is shown that binary constant weight codes meet the bound of Fu and Shen if and only if they are generated from certain symmetric designs and quasi-symmetric designs in combinatorial design theory. In particular, it turns out that the existence of binary codes with even length meeting the Grey–Rankin bound is equivalent to the existence of certain binary constant weight codes meeting the bound of Fu and Shen. Furthermore, some examples are listed to illustrate these results. Finally, we obtain a new upper bound on binary constant weight codes which improves on the bound of Fu and Shen in certain case. This research is supported in part by the DSTA research grant R-394-000-025-422 and the National Natural Science Foundation of China under the Grant 60402031, and the NSFC-GDSF joint fund under the Grant U0675001     

Johnson type bounds on constant dimension codes

Very recently, an operator channel was defined by Koetter and Kschischang when they studied random network coding. They also introduced constant dimension codes and demonstrated that these codes can be employed to correct errors and/or erasures over the operator channel. Constant dimension codes are equivalent to the so-called linear authentication codes introduced by Wang, Xing and Safavi-Naini when constructing distributed authentication systems in 2003. In this paper, we study constant dimension codes. It is shown that Steiner structures are optimal constant dimension codes achieving the Wang-Xing-Safavi-Naini bound. Furthermore, we show that constant dimension codes achieve the Wang-Xing-Safavi-Naini bound if and only if they are certain Steiner structures. Then, we derive two Johnson type upper bounds, say I and II, on constant dimension codes. The Johnson type bound II slightly improves on the Wang-Xing-Safavi-Naini bound. Finally, we point out that a family of known Steiner structures is actually a family of optimal constant dimension codes achieving both the Johnson type bounds I and II.      

The triple distribution of codes and ordered codes

We study the distribution of triples of codewords of codes and ordered codes. Schrijver [A. Schrijver, New code upper bounds from the Terwilliger algebra and semidefinite programming, IEEE Trans. Inform. Theory 51 (8) (2005) 2859–2866] used the triple distribution of a code to establish a bound on the number of codewords based on semidefinite programming. In the first part of this work, we generalize this approach for ordered codes. In the second part, we consider linear codes and linear ordered codes and present a MacWilliams-type identity for the triple distribution of their dual code. Based on the non-negativity of this linear transform, we establish a linear programming bound and conclude with a table of parameters for which this bound yields better results than the standard linear programming bound.     

On constant composition codes

A constant composition code over a k-ary alphabet has the property that the numbers of occurrences of the k symbols within a codeword is the same for each codeword. These specialize to constant weight codes in the binary case, and permutation codes in the case that each symbol occurs exactly once. Constant composition codes arise in powerline communication and balanced scheduling, and are used in the construction of permutation codes. In this paper, direct and recursive methods are developed for the construction of constant composition codes.     

Construction of optimal ternary constant weight codes via Bhaskar Rao designs

In this note, we consider a construction for optimal ternary constant weight codes (CWCs) via Bhaskar Rao designs (BRDs). The known existence results for BRDs are employed to generate many new optimal nonlinear ternary CWCs with constant weight 4 and minimum Hamming distance 5.     

The structure of linear codes of constant weight

In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.

     

Linear codes with few weights from weakly regular plateaued functions

Linear codes with few nonzero weights have wide applications in secret sharing, authentication codes, association schemes and strongly regular graphs. Recently, Wu et al. (2020) obtained some few-weighted linear codes by employing bent functions. In this paper, inspired by Wu et al. and some pioneers' ideas, we use a kind of functions, namely, general weakly regular plateaued functions, to define the defining sets of linear codes. Then, by utilizing some cyclotomic techniques, we construct some linear codes with few weights and obtain their weight distributions. Notably, some of the obtained codes are almost optimal with respect to the Griesmer bound. Finally, we observe that our newly constructed codes are minimal for almost all cases.     

Two-weight and three-weight linear codes based on Weil sums

Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their weight distributions are determined using Weil sums. Some of the linear codes obtained are optimal or almost optimal with respect to the Griesmer bound.