The relative generalized Hamming weight of linear q-ary codes and their subcodes

In this article, some properties of the relative generalized Hamming weight (RGHW) of linear codes and their subcodes are developed with techniques in finite projective geometry. The relative generalized Hamming weights of almost all 4-dimensional q-ary linear codes and their subcodes are determined.      

Notes on use of strict optical orthogonal codes to design unequal channel spacing (UCS) frequency sequences for DWDM systems with reduced FWM crosstalk

A paper [E. Mutafungwa et al., Optics Communications 198 (4) (2001) 339] reported the use of strict optical orthogonal codes (S-OOC’s) to reduce the four-wave mixing (FWM) crosstalk in dense wavelength-division multiplexing (DWDM) systems by using our S-OOC based unequal channel spacing (UCS) scheme and our special frequency sequences constructed, without referring to the original work. Some mistakes and inaccuracies are identified in the published paper regarding interpretation of S-OOC and its associated UCS scheme, which can cause the confusion of understanding the key concepts and principle about the S-OOC based UCS scheme. As a result, in this paper we present the necessary corrections and notes which deal with the major expressions and key concepts of both S-OOC’s and our proposed scheme. In doing so, the mapping of a S-OOC sequence to the UCS frequency set is appropriately interpreted, and the characteristics of S-OOC based UCS schemes are described. Moreover, the correct evaluation of optical bandwidths is presented for DWDM systems using S-OOC based UCS schemes, and the comparison of the repeated-codeword assignments with the overlapping-codeword assignments is also carried out. Furthermore, we discuss the effect of fractional-slot occupation for frequency assignments on the bandwidth expansion of UCS-DWDM systems. These in turn can lead to correctly understanding the principles of S-OOC based UCS schemes and applying them to assign the UCS frequencies to DWDM systems for the reduction of FWM crosstalk.     

Binary permutation sequences as subsets of Levenshtein codes,spectral null codes,run-length limited codes and constant weight codes

We investigate binary sequences which can be obtained by concatenating the columns of (0,1)-matrices derived from permutation sequences. We then prove that these binary sequences are subsets of a surprisingly diverse ensemble of codes, namely the Levenshtein codes, capable of correcting insertion/deletion errors; spectral null codes, with spectral nulls at certain frequencies; as well as being subsets of run-length limited codes, Nyquist null codes and constant weight codes. This paper was presented in part at the IEEE Information Theory Workshop, Chengdu, China, October, 2006.     

On the code generated by the incidence matrix of points and hyperplanes in <Emphasis Type="Italic">PG</Emphasis>(<Emphasis Type="Italic">n</Emphasis>,<Emphasis Type="Italic">q</Emphasis>) and its dual

In this paper, we study the p-ary linear code C(PG(n,q)), q = p ^h , p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979). G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology in Flanders (IWT-Vlaanderen).     

Leptogenesis from neutralino decay with nonholomorphic R-parity violation

In supersymmetric models with lepton-number violation, hence also R-parity violation, it is easy to have realistic neutrino masses, but then leptogenesis becomes difficult to achieve. After explaining the general problems involved, we study the details of a model which escapes these constraints and generates a lepton asymmetry, which gets converted into the present observed baryon asymmetry of the Universe through the electroweak sphalerons. This model requires the presence of certain nonholomorphic R-parity violating terms. For completeness we also present the most general R-parity violating Lagrangian with soft nonholomorphic terms and study their consequences for the charged-scalar mass matrix. New contributions to neutrino masses in this scenario are discussed.     

Cyclically permutable representations of cyclic codes

Cyclically permutable codes have been studied for several applications involving synchronization, code-division multiple-access (CDMA) radio systems and optical CDMA. The usual emphasis is on finding constant weight cyclically permutable codes with the maximum number of codewords. In this paper the question of when a particular error-correcting code is equivalent (by permutation of the symbols) to a cyclically permutable code is addressed. The problem is introduced for simplex codes and a motivating example is given. In the final section it is shown that the construction technique may be applied in general to cyclic codes.     

The Existence of （v, 4, 1） Disjoint Difference Families with v a Prime Power

A （v, k, λ） difference family （（v, k, λ）-DF in short） over an abelian group G of order v, is a collection F=（Bi｜i ∈ I} of k-subsets of G, called base blocks, such that any nonzero element of G can be represented in precisely A ways as a difference of two elements lying in some base blocks in F. A （v, k, λ）-DDF is a difference family with disjoint blocks. In this paper, by using Weil＇s theorem on character sum estimates, it is proved that there exists a （p^n, 4, 1）-DDF, where p = 1 （rood 12） is a prime number and n ≥1.     

Regular LDPC Codes from Semipartial Geometries

By considering a class of combinatorial structures, known as semipartial geometries, we define a class of low-density parity-check (LDPC) codes. We derive bounds on minimum distance, rank and girth for the codes from semipartial geometries, and present constructions and performance results for the classes of semipartial geometries which have not previously been proposed for use with iterative decoding.     

ON SELF-DUAL PERMUTATION CODES

Permutation codes over finite fields are introduced, some conditions for exis-tence or non-existence of self-dual permutation codes are obtained.     

Constructions of almost difference families

Almost difference families (ADFs) are a useful generalization of almost difference sets (ADSs). In this paper, we present some constructive techniques to obtain ADFs and establish a number of infinite classes of ADFs. Our results can be regarded as a generalization of the known difference families. It is clear that ADFs give partially balance incomplete block designs which arise in a natural way in many combinatorial and statistical problems.