High-rate self-synchronizing codes

Self-synchronization under the presence of additive noise can be achieved by allocating a certain number of bits of each codeword as markers for synchronization. Difference systems of sets are combinatorial designs which specify the positions of synchronization markers in codewords in such a way that the resulting error-tolerant self-synchronizing codes may be realized as cosets of linear codes. Ideally, difference systems of sets should sacrifice as few bits as possible for a given code length, alphabet size, and error-tolerance capability. However, it seems difficult to attain optimality with respect to known bounds when the noise level is relatively low. In fact, the majority of known optimal difference systems of sets are for exceptionally noisy channels, requiring a substantial amount of bits for synchronization. To address this problem, we present constructions for difference systems of sets that allow for higher information rates while sacrificing optimality to only a small extent. Our constructions utilize optimal difference systems of sets as ingredients and, when applied carefully, generate asymptotically optimal ones with higher information rates. We also give direct constructions for optimal difference systems of sets with high information rates and error-tolerance that generate binary and ternary self-synchronizing codes.Comment: 9 pages, no figure, 2 tables. Final accepted version for publication in the IEEE Transactions on Information Theory. Material presented in part at the International Symposium on Information Theory and its Applications, Honolulu, HI USA, October 201

Development of User-Interface Software Program for Double Weight Code Family for OCDMA

Optical Code Division Multiple Access (OCDMA) offers high statistical multiplexing gain in a busty traffic environment and is thought to be a more suitable solution in local-area network. There have been many codes proposed OCDMA systems, such as Hadamard code, Modified Frequency Hopping (MFH) code and Double Weight (DW) code family. The inspiration of this study is to improve the Modified Double Weight (MDW) code to give a better performance and to enhance the detection technique of DW code family. There are few aspects that have been identified in this study. First of all, the construction of MDW code is studied. Besides, the equation-based construction technique is examined and is then simulated using Virtual Basic software version 6.0. The findings of the project will lead to a new development of the MDW code by having new user-interface software program to generate the DW codeword with an ease

Optimal Partitioned Cyclic Difference Packings for Frequency Hopping and Code Synchronization

Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, based on almost difference sets and cyclic difference matrices, are given. These produce new infinite families of optimal PCDPs (and hence optimal frequency-hopping sequences and optimal comma-free codes). The existence problem for optimal PCDPs in ${\mathbb Z}_{3m}$, with $m$ base blocks of size three, is also solved for all $m\not\equiv 8,16\pmod{24}$.Comment: to appear in IEEE Transactions on Information Theor

Frame difference families and resolvable balanced incomplete block designs

Frame difference families, which can be obtained via a careful use of cyclotomic conditions attached to strong difference families, play an important role in direct constructions for resolvable balanced incomplete block designs. We establish asymptotic existences for several classes of frame difference families. As corollaries new infinite families of 1-rotational $(pq+1,p+1,1)$-RBIBDs over $\mathbb{F}_{p}^+ \times \mathbb{F}_{q}^+$ are derived, and the existence of $(125q+1,6,1)$-RBIBDs is discussed. We construct $(v,8,1)$-RBIBDs for $v\in\{624,1576,2976,5720,5776,10200,14176,24480\}$, whose existence were previously in doubt. As applications, we establish asymptotic existences for an infinite family of optimal constant composition codes and an infinite family of strictly optimal frequency hopping sequences.Comment: arXiv admin note: text overlap with arXiv:1702.0750

MIMO Radar Ambiguity Properties and Optimization Using Frequency-Hopping Waveforms

The concept of multiple-input multiple-output (MIMO) radars has drawn considerable attention recently. Unlike the traditional single-input multiple-output (SIMO) radar which emits coherent waveforms to form a focused beam, the MIMO radar can transmit orthogonal (or incoherent) waveforms. These waveforms can be used to increase the system spatial resolution. The waveforms also affect the range and Doppler resolution. In traditional (SIMO) radars, the ambiguity function of the transmitted pulse characterizes the compromise between range and Doppler resolutions. It is a major tool for studying and analyzing radar signals. Recently, the idea of ambiguity function has been extended to the case of MIMO radar. In this paper, some mathematical properties of the MIMO radar ambiguity function are first derived. These properties provide some insights into the MIMO radar waveform design. Then a new algorithm for designing the orthogonal frequency-hopping waveforms is proposed. This algorithm reduces the sidelobes in the corresponding MIMO radar ambiguity function and makes the energy of the ambiguity function spread evenly in the range and angular dimensions