循环■线性■码的一些结论

令F_q是一个含有q个元素的有限域,其中q是素数p的方幂,t≥2是满足t■1 (modp)的偶数,且■是F_q的次数为t的扩域.本文给出■上的一个迹双线性型内积Δ,其中n是一个与q互素的正整数.根据定义的迹内积,研究循环Δ-自正交和循环Δ-自对偶■线性■码的基和计数.此外,给出一些参数好的■线性■码.     

区组大小为 4 的二重超单可分解的可分组设计

自 1992 年 Gronau 和 Mullin 提出超单设计的概念以来, 很多研究者参与了超单设计的研究. 超单设计在编码等方面也有广泛的应用. 超单可分组设计是超单设计的重要组成部分. 本文我们主要研究区组大小为4 的二重超单可分解的可分组设计, 并基本解决了此类设计的存在性问题.     

两类新的最优变重量光正交码

变重量光正交码用于光码分多址通信系统以满足不同服务质量用户需求.给出当u≥5为素数时,最优(16u,{3,5},1,{2/3,1/3))交重量光正交码的具体构造.同时证明了当u≥5为素数时,存在一个最优(25u,{3,4,5},1,{1/4,2/4,1/4})变重量光正交码.这将改进变重量光正交码的存在性结果.     

关于单BCI－代数的一些结果

本文讨论了单ＢＣＩ－代数．证明了一个ＢＣＩ－代数是单的当且仅当它的子代数都是单的；给出了单ｐ－半单ＢＣＩ－代数的一种表示式；证明了一个ｐ－半单ＢＣＩ－代数是单的当且仅当它的阶是素数；这样得到了一批（无限多个）单ＢＣＩ－代数；证明了商ＢＣＫ－代数Ｘ／Ａ是单的当且仅当Ａ是Ｘ的极大理想．     

循环矩阵的一些性质

本文给出了循环矩阵的一些性质.     

码重为3和7的最优光正交码的具体构造

对光正交码(OOC)构造的关注源于它在光码分多址网络中有许多应用.截至目前,对于码重为W∈{{3,4},{3,5},{3,6},{4,5},{4,6]}的变重量光正交码的构造已经取得许多结果.然而,对于码重为W={3,7}的变重量光正交码的具体构造非常的少.给出一系列新的最优变重量光正交码(33p,{3,7},1,{4/5,1/5})-OOC的具体构造,对于任何素数p≡3(mod 4)且p≥7.     

多水平超饱和设计的一类构造方法

过去超饱和设计的研究集中在2水平设计的范围内,Lu and Sun(2000)首次讨论了高于2水平因子的超饱和设计问题,该文提出了用E（d^2)作为构造超饱和设计的准则,并给出了E（d^2)最优的一些设计,本文讨论了以给定的Max(d^2)为前提构造超饱和设计的方法,并给出了一些三水平和四水平的超饱和设计。     

最优(v,{3,4},1,Q)-光正交码的构造

在光纤码分多址(OCDMA)系统中,变重量光正交码被广泛使用,以满足多种服务质量的需求.利用分圆类和斜starter给出了直接构造方法,借助有关循环差阵的递归构造方法,从而构造了两类循环填充设计.通过建立循环填充设计与变重量光正交码之间的联系,证明了当Q∈{{2/3,1/3},{3/4,1/4}}时,最优(v,{3,4},1,Q)-光正交码存在的无穷类.     

可分解不完全区组设计的若干结果

考虑某类可分解不完全区组设计——PRIB设计的均匀性. 在一离散偏差度量意义下, 得到了PRIB设计是最均匀设计的一个充要条件；证明了均匀PRIB设计是关联的；提出了用某类U-型设计构造这类区组设计的方法, 并给出了该类设计的一个存在性结果, 这一方法建立起了PRIB设计和U-型设计之间的一重要桥梁.     

基于超循环理论的组织循环系统及其性能评价

企业同生物体一样,健康和能源是其生存的基本条件.企业中表现为良好的经营能力和持续不断的资源.这至少依赖于两个循环系统来完成:新陈代谢循环系统和资源平衡循环系统.这两个循环系统之间还具有一定的协同关系.二者失去平衡,同样会导致企业的失败.新陈代谢循环、资源平衡循环以及其它一些支持循环的协同运转构成了一个完整的组织循环系统.从企业的生存入手,对企业的循环系统的构成和要素进行研究.在此基础上,研究组织循环性能的评价方法,包括平衡性、鲁棒性和平滑性三个方面.     

Super-simple (ν, 5, 5) Designs

Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. In this article, we investigate the existence of a super-simple (ν, 5, 5) balanced incomplete block design and show that such a design exists if and only if ν ≡ 1 (mod 4) and ν ≥ 17 except possibly when ν = 21. Applications of the results to optical orthogonal codes are also mentioned. Research supported by NSERC grant 239135-01.     

On GMW Designs and Cyclic Hadamard Designs

We generalise results of Jackson concerning cyclic Hadamard designs admitting SL(2,2ⁿ) as a point transitive automorphism group. The generalisation concerns the designs of Gordon, Mills and Welch and we characterise these as designs admitting GM(m,qⁿ) acting in a certain way. We also generalise a construction given by Maschietti, using hyperovals, of cyclic Hadamard designs, and characterise these amongst the designs of Gordon, Mills and Welch.     

Some Results on Minimum Aberration Mixed-level （2^r）2^n Factorial Designs

Mukerjee and Wu(2001) employed projective geometry theory to find the wordlength pattern of a regular mixed factorial design in terms of its complementary set, but only for the numbers of words of length 3 or 4.In this paper,by introducing a concept of consulting design and based on the connection between factorial design theory and cod- ing theory,we obtain some combinatorial identities that relate the wordlength pattern of a regular mixed-level (2~r)2~n factorial design to that of its consulting design.Consequently,a general rule for identifying minimum aberration (2~r)2~n factorial designs through their con- sulting designs is established.It is an improvement and generalization of the related result in Mukerjee and Wu(2001).     

Some New Results on ‐Cyclic Patterned Starter Whist Tournaments and Related Frames

The whist tournament problem was introduced by Moore in 1896. To construct ‐cyclic whist tournaments, ‐cyclic patterned starter whist tournaments were introduced. The systematic research on ‐cyclic patterned starter whist tournaments dates back to 1954. Recently, ‐cyclic patterned starter whist tournament frames were shown to be instrumental in the constructions of ‐cyclic patterned starter whist tournaments. In this paper, we develop some necessary conditions for the existence of ‐cyclic patterned starter whist tournament frames and some new necessary conditions for the existence of ‐cyclic patterned starter whist tournaments. An infinite family of ‐cyclic patterned starter whist tournament frames is constructed through Weil's theorem on character sums. As a consequence, a new infinite family of ‐cyclic patterned starter whist tournaments is obtained. In addition, we also give a near complete solution to the existence of ‐cyclic patterned starter whist tournaments on no greater than 300 players.     

Super-simple Steiner pentagon systems

A Steiner pentagon system of order v(SPS(v)) is said to be super-simple if its underlying (v,5,2)-BIBD is super-simple; that is, any two blocks of the BIBD intersect in at most two points. In this paper, it is shown that the necessary condition for the existence of a super-simple SPS(v); namely, v?5 and v≡1 or is sufficient, except for v=5, 15 and possibly for v=25. In the process, we also improve an earlier result for the spectrum of super-simple (v,5,2)-BIBDs, removing all the possible exceptions. We also give some new examples of Steiner pentagon packing and covering designs (SPPDs and SPCDs).     

Some Results on Pseudosquares

If is an odd prime, the pseudosquare is defined to be the least positive nonsquare integer such that and the Legendre symbol for all odd primes . In this paper we first discuss the connection between pseudosquares and primality testing. We then describe a new numerical sieving device which was used to extend the table of known pseudosquares up to . We also present several numerical results concerning the growth rate of the pseudosquares, results which so far confirm that , an inequality that must hold under the extended Riemann Hypothesis.