Linear codes associated to skew-symmetric determinantal varieties

In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum distances of these codes are determined and a recursive formula for the weight of a general codeword in these codes is given.     

虚拟解法分析浸入边界法的精度

浸入边界法是对流固耦合系统进行建模和模拟的有效工具,在生物力学领域的应用尤为广泛．该文的工作主要包含两个部分:程序验证和精度分析．前者证明了程序的正确性,后者给出了浸入边界法的精度．两部分工作均使用虚拟解法作为研究工具．在程序验证部分,使用二阶空间离散格式进行数值计算,通过分析各种变量的离散误差,得到的程序计算精度阶是二阶,与理论精度阶一致,证明了数值计算所使用程序的正确性．精度分析部分工作在此基础上展开．引入压强跳跃,在动量方程中加入相应源项,通过分析带有源项的控制方程中各物理量的离散误差,证明浸入边界法只具有一阶精度．同时可以得出以下结论:粗网格无法敏感地捕捉浸入边界的影响;当Euler网格固定时,增加Lagrange标志点的数目并不会改善计算误差．     

The depth spectrums of constacyclic codes over finite chain rings

In light of the generator polynomials of constacyclic codes over finite chain rings, the depth spectrum of constacyclic codes can be determined if (n,p)=1$(n,p)=1$.     

Bounds and Constructions for Two‐Dimensional Variable‐Weight Optical Orthogonal Codes

Optical orthogonal codes (1D constant‐weight OOCs or 1D CWOOCs) were first introduced by Salehi as signature sequences to facilitate multiple access in optical fibre networks. In fiber optic communications, a principal drawback of 1D CWOOCs is that large bandwidth expansion is required if a big number of codewords is needed. To overcome this problem, a two‐dimensional (2D) (constant‐weight) coding was introduced. Many optimal 2D CWOOCs were obtained recently. A 2D CWOOC can only support a single QoS (quality of service) class. A 2D variable‐weight OOC (2D VWOOC) was introduced to meet multiple QoS requirements. A 2D VWOOC is a set of 0, 1 matrices with variable weight, good auto, and cross‐correlations. Little is known on the construction of optimal 2D VWOOCs. In this paper, new upper bound on the size of a 2D VWOOC is obtained, and several new infinite classes of optimal 2D VWOOCs are obtained.     

Classification of Graeco‐Latin Cubes

A q‐ary code of length n, size M, and minimum distance d is called an code. An code with is said to be maximum distance separable (MDS). Here one‐error‐correcting () MDS codes are classified for small alphabets. In particular, it is shown that there are unique (5, 5³, 3)₅ and (5, 7³, 3)₇ codes and equivalence classes of (5, 8³, 3)₈ codes. The codes are equivalent to certain pairs of mutually orthogonal Latin cubes of order q, called Graeco‐Latin cubes.     

Mutually disjoint designs and new 5‐designs derived from groups and codes

The article gives constructions of disjoint 5‐designs obtained from permutation groups and extremal self‐dual codes. Several new simple 5‐designs are found with parameters that were left open in the table of 5‐designs given in (G. B. Khosrovshahi and R. Laue, t‐Designs with t⩾3, in “Handbook of Combinatorial Designs”, 2nd edn, C. J. Colbourn and J. H. Dinitz (Editors), Chapman & Hall/CRC, Boca Raton, FL, 2007, pp. 79–101), namely, 5−(v, k, λ) designs with (v, k, λ)=(18, 8, 2m) (m=6, 9), (19, 9, 7m) (m=6, 9), (24, 9, 6m) (m=3, 4, 5), (25, 9, 30), (25, 10, 24m) (m=4, 5), (26, 10, 126), (30, 12, 440), (32, 6, 3m) (m=2, 3, 4), (33, 7, 84), and (36, 12, 45n) for 2⩽n⩽17. These results imply that a simple 5−(v, k, λ) design with (v, k)=(24, 9), (25, 9), (26, 10), (32, 6), or (33, 7) exists for all admissible values of λ. © 2010 Wiley Periodicals, Inc. J Combin Designs 18: 305–317, 2010     

从符号学出发的城市家具设计

本文从符号学的角度来分析城市家具的设计，是对设计如何满足现代社会发展需求的探索，从功能到符号，从符号到设计，设计不再是绘画的附属，而是建立符号系统的过程．