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.     

常重复合码的构造和界

摘要给出了一种Chebyshev距离下的常重复合码的构造,并在其基础上讨论了它的译码算法和优化处理.考虑了Chebyshev距离下的界及其改进.研究了具有Chebyshev距离和Hamming距离的常重复合码的构造,给出了Hamming距离为4的常重复合码的一个结论.     

The combinatorial construction for a class of optimal optical orthogonal codes

Optical orthogonal code (OOC) has good correlation properties. It has many important applications in a fiber-optic code-division multiple access channel. In this paper, a combinatorial construction for optimal(15p, 5,1) optical orthogonal codes withp congruent to 1 modulo 4 and greater than 5 is given by applying Weil's Theorem. From this, whenv is a product of primes congruent to 1 modulo 4 and greater than 5, an optimal (15v, 5, 1)-OOC can be obtained by applying a known recursive construction.     

常维码的一个构造性下界

推广了Etzion和Vardy关于常维码的结论（Etzion T,Vardy A.Error-correcting codes in projective space.IEEE Transactions on Information Theory,2011,57（2）：1165-1173）,给出了一般情况下常维码的一个构造性下界.     

A new concatenated type construction for LCD codes and isometry codes

We give a new concatenated type construction for linear codes with complementary dual (LCD) over small finite fields. In this construction,we need a special class of inner codes that we call isometry codes. Our construction generalizes a recent construction of Carlet et al. (2014–2016) and of Güneri et al. (2016). In particular, it allows us to construct LCD codes with improved parameters directly.     

A class of optimal constant composition codes from GDRPs

As a common generalization of constant weight binary codes and permutation codes, constant composition codes (CCCs) have attracted recent interest due to their numerous applications. In this paper, a class of new CCCs are constructed using design-theoretic techniques. The obtained codes are optimal in the sense of their sizes. This result is established, for the most part, by means of a result on generalized doubly resolvable packings which is of combinatorial interest in its own right.      

Optimal doubly constant weight codes

A doubly constant weight code is a binary code of length n₁ + n₂, with constant weight w₁ + w₂, such that the weight of a codeword in the first n₁ coordinates is w₁. Such codes have applications in obtaining bounds on the sizes of constant weight codes with given minimum distance. Lower and upper bounds on the sizes of such codes are derived. In particular, we show tight connections between optimal codes and some known designs such as Howell designs, Kirkman squares, orthogonal arrays, Steiner systems, and large sets of Steiner systems. These optimal codes are natural generalization of Steiner systems and they are also called doubly Steiner systems. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 137–151, 2008     

A problem of combinatorial designs related to authentication codes

The strong partially balanced t-designs can be used to construct authentication codes, whose probabilities P_r of successful deception in an optimum spoofing attack of order r for r = 0, 1, …, t − 1, achieve their information-theoretic lower bounds. In this paper a new family of strong partially balanced t-designs are constructed by means of rational normal curves over finite fields. Thus based on this new partially balanced t-designs a new class of authentication codes is obtained. © 1998 John Wiley & Sons, Inc. J Combin Designs 6: 417–429, 1998     

A combinatorial approach to jumping particles: The parallel TASEP

In this article, we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric simple exclusion process or TASEP (Duchi and Schaeffer, Journal of Combinatorial Theory, Series A, 110(2005), 1–29). We consider here the parallel TASEP, in which particles can jump simultaneously. On the one hand, the interest in this process comes from highway traffic modeling: it is the only solvable special case of the Nagel‐Schreckenberg automaton, the most popular model in that context. On the other hand, the parallel TASEP is of some theoretical interest because the derivation of its stationary distribution, as appearing in the physics literature, is harder than that of the standard TASEP. We offer here an elementary derivation that extends the combinatorial approach we developed for the standard TASEP. In particular, we show that this stationary distribution can be expressed in terms of refinements of Catalan numbers. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

A construction of Gray codes inducing complete graphs

A binary Gray code G(n) of length n, is a list of all 2ⁿn-bit codewords such that successive codewords differ in only one bit position. The sequence of bit positions where the single change occurs when going to the next codeword in G(n), denoted by S(n)?s₁,s₂,…,s_2ⁿ-1, is called the transition sequence of the Gray code G(n). The graph G_G(n) induced by a Gray code G(n) has vertex set {1,2,…,n} and edge set {{s_i,s_i+1}:1?i?2ⁿ-2}. If the first and the last codeword differ only in position s_2ⁿ, the code is cyclic and we extend the graph by two more edges {s_2ⁿ-1,s_2ⁿ} and {s_2ⁿ,s₁}. We solve a problem of Wilmer and Ernst [Graphs induced by Gray codes, Discrete Math. 257 (2002) 585-598] about a construction of an n-bit Gray code inducing the complete graph K_n. The technique used to solve this problem is based on a Gray code construction due to Bakos [A. Ádám, Truth Functions and the Problem of their Realization by Two-Terminal Graphs, Akadémiai Kiadó, Budapest, 1968], and which is presented in D.E. Knuth [The Art of Computer Programming, vol. 4, Addison-Wesley as part of “fascicle” 2, USA, 2005].     

A new approach to constant term identities and Selberg-type integrals

Selberg-type integrals that can be turned into constant term identities for Laurent polynomials arise naturally in conjunction with random matrix models in statistical mechanics. Built on a recent idea of Karasev and Petrov we develop a general interpolation based method that is powerful enough to establish many such identities in a simple manner. The main consequence is the proof of a conjecture of Forrester related to the Calogero–Sutherland model. In fact we prove a more general theorem, which includes Aomoto's constant term identity at the same time. We also demonstrate the relevance of the method in additive combinatorics.     

A new approach to the covering radius of codes

We introduce a new approach which facilitates the calculation of the covering radius of a binary linear code. It is based on determining the normalized covering radius ϱ. For codes of fixed dimension we give upper and lower bounds on ϱ that are reasonably close. As an application, an explicit formula is given for the covering radius of an arbitrary code of dimension ⩽4. This approach also sheds light on whether or not a code is normal. All codes of dimension ⩽4 are shown to be normal, and an upper bound is given for the norm of an arbitrary code. This approach also leads to an amusing generalization of the Berlekamp-Gale switching game.     

TWO NEW CONSTRUCTIONS OF CARTESIAN AUTHENTICATION CODES FROM SYMPLECTIC GEOMETRY

ＴＷＯＮＥＷＣＯＮＳＴＲＵＣＴＩＯＮＳＯＦＣＡＲＴＥＳＩＡＮＡＵＴＨＥＮＴＩＣＡＴＩＯＮＣＯＤＥＳＦＲＯＭＳＹＭＰＬＥＣＴＩＣＧＥＯＭＥＴＲＹＧＡＯＹＯＵＡＮＤＺＯＵＺＥＮＧＪＩＡ（ＤｅｐａｒｔｍｅｎｔｏｆＢａｓｉｃＳｃｉｅｎｃｅ，Ｎｏｒｔｈｅａｓｔ...     

A construction of mutually disjoint Steiner systems from isomorphic Golay codes

It is well known that the extended binary Golay [24,12,8] code yields 5-designs. In particular, the supports of all the weight 8 codewords in the code form a Steiner system S(5,8,24). In this paper, we give a construction of mutually disjoint Steiner systems S(5,8,24) by constructing isomorphic Golay codes. As a consequence, we show that there exists at least 22 mutually disjoint Steiner systems S(5,8,24). Finally, we prove that there exists at least 46 mutually disjoint 5-(48,12,8) designs from the extended binary quadratic residue [48,24,12] code.     

On a new geometric constant related to the von Neumann-Jordan constant

The von Neumann-Jordan constant CNJ(X) is computed for X being ?₂−?₁ and ?_∞−?₁ space by introducing a new geometric constant γX(t). These partly give an answer to an open question posed by Kato et al. Some basic properties of this new coefficient are investigated. Moreover, we obtain a new class of Banach spaces with uniform normal structure.     

A transform approach to polycyclic and serial codes over rings

In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant subspaces as well as understand the duality in terms of the transform domain. We also make a characterization of when two polycyclic ambient spaces are Hamming-isometric.     

Optimal cyclic quaternary constant‐weight codes of weight three

A cyclic code is a cyclic q‐ary code of length n, constant weight w and minimum distance d. Let denote the largest possible size of a cyclic code. The pure and mixed difference method plays an important role in the determination of upper bound on . By analyzing the distribution of odd mixed and pure differences, an improved upper bound on is obtained for . A new construction based on special sequences is provided and the exact value of is almost completely determined for all d and n except when and . Our constructions reveal intimate connections between cyclic constant weight codes and special sequences, particularly Skolem‐type sequences.