On Balanced Optimal Optical Orthogonal Codes

Variable‐weight optical orthogonal codes (OOCs) were introduced by G.‐C. Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, by using incomplete difference matrices and perfect relative difference families, a balanced ‐OOC is obtained for every positive integer .     

Spreading Code Design Using a Global Optimization Method

The performance of a code division multiple access system depends on the correlation properties of the employed spreading code. Low cross-correlation values between spreading sequences are desired to suppress multiple access interference and to improve bit error performance. An auto-correlation function with a distinct peak enables proper synchronization and suppresses intersymbol interference. However, these requirements contradict each other and a trade-off needs to be established. In this paper, a global two dimensional optimization method is proposed to minimize the out-of-phase average mean-square aperiodic auto-correlation with average mean-square aperiodic cross-correlation being allowed to lie within a fixed region. This approach is applied to design sets of complex spreading sequences. A design example is presented to illustrate the relation between various correlation characteristics. The correlations of the obtained sets are compared with correlations of other known sequences.     

Skew codes of prescribed distance or rank

In this paper we generalize the notion of cyclic code and construct codes as ideals in finite quotients of non-commutative polynomial rings, so called skew polynomial rings of automorphism type. We propose a method to construct block codes of prescribed rank and a method to construct block codes of prescribed distance. Since there is no unique factorization in skew polynomial rings, there are much more ideals and therefore much more codes than in the commutative case. In particular we obtain a [40, 23, 10]₄ code by imposing a distance and a [42,14,21]₈ code by imposing a rank, which both improve by one the minimum distance of the previously best known linear codes of equal length and dimension over those fields. There is a strong connection with linear difference operators and with linearized polynomials (or q-polynomials) reviewed in the first section.      

There exists no self-dual [24,12,10] code over $${{\mathbb F}_5}$$

Self-dual codes over exist for all even lengths. The smallest length for which the largest minimum weight among self-dual codes has not been determined is 24, and the largest minimum weight is either 9 or 10. In this note, we show that there exists no self-dual [24, 12, 10] code over , using the classification of 24-dimensional odd unimodular lattices due to Borcherds.      

Enumerating and decoding perfect linear Lee codes

Using group theory approach, we determine all numbers q for which there exists a linear 1-error correcting perfect Lee code of block length n over Z _q , and then we enumerate those codes. At the same time this approach allows us to design a linear time decoding algorithm.      

一类具有三重量的循环码

本文研究了指数和S(α,β)=Σx∈F_pmχ(αx^(pk+1)/(2))+βx^(p3k+1)/(2)的值分布.应用S(α,β)的值分布,确定了一类p元循环码的重量分布,证明了所提出的循环码具有三个非零重量,这里p是奇素数,m和k是两个正整数,满足m/gcd (m,k)是奇数,k/gcd (m,k)是偶数以及m ≥ 3.     

基于循环码的常重复合码的构造

研究给出了一类基于循环码的常重复合码的构造,并利用指数和计算其参数.与相关的常重复合码相比,该码具有更多的码字,且渐近性较好.     

Extremal self-dual codes of length 64 through neighbors and covering radii

We construct extremal singly even self-dual [64,32,12] codes with weight enumerators which were not known to be attainable. In particular, we find some codes whose shadows have minimum weight 12. By considering their doubly even neighbors, extremal doubly even self-dual [64,32,12] codes with covering radius 12 are constructed for the first time.     

Symplectic spread-based generalized Kerdock codes

Kerdock codes (Kerdock, Inform Control 20:182–187, 1972) are a well-known family of non-linear binary codes with good parameters admitting a linear presentation in terms of codes over the ring (see Nechaev, Diskret Mat 1:123–139, 1989; Hammons et al., IEEE Trans Inform Theory 40:301–319, 1994). These codes have been generalized in different directions: in Calderbank et al. (Proc Lond Math Soc 75:436–480, 1997) a symplectic construction of non-linear binary codes with the same parameters of the Kerdock codes has been given. Such codes are not necessarily equivalent. On the other hand, in Kuzmin and Nechaev (Russ Math Surv 49(5), 1994) the authors give a family of non-linear codes over the finite field F of q = 2 ^l elements, all of them admitting a linear presentation over the Galois Ring R of cardinality q ² and characteristic 2². The aim of this article is to merge both approaches, obtaining in this way new families of non-linear codes over F that can be presented as linear codes over the Galois Ring R. The construction uses symplectic spreads.      

Solid codes and the uniform density of fd-domains

By means of further investigation of solid codes,the problem“Is every fd-domain uni- formly dense”proposed by Yuqi Guo,C.M.Reis and G.Thierrin in 1988 is solved in this paper.