A new class of optimal optical orthogonal codes with weight six

Abstract

In this paper, we give a direct construction for gregular cyclic difference packings CDP(6, 1; gp)'s by utilizing Weil's theorem on character sum estimates over GF(p) with prime congruent to 7 modulo 12 and greater than 7, where g = 15, 20. As its application, we obtain a new class of optimal (gv, 6, 1) optical orthogonal codes with v a product of primes congruent to 7 modulo 12 and greater than 7 and g = 15, 20, 105, 140. key words: Optimal optical orthogonal code, Regular cyclic difference packing.

Jointly designed quasi-cyclic LDPC-coded cooperation with diversity combining at receiver

“…In this correspondence, we propose a jointly designed QC-LDPC-coded multi-relay cooperation with destination node realized by multiple receive antennas over a Rayleigh fading channel in the presence of additive white Gaussian noise. First, a combinatorial construction of QC-LDPC codes based on cyclic difference packing (CDP) 37–43 gives three classes of binary QC-LDPC codes with no length-4 cycles. Second, the proposed CDP-based construction is utilized to jointly design QC-LDPC codes with no length-4 cycles for coded-relay cooperation.…”

A Deterministic Construction for Jointly Designed Quasicyclic LDPC Coded-Relay Cooperation

“…In this correspondence, we propose a jointly designed QC-LDPC coded-relay cooperation with joint-iterative decoding in the destination node over a Rayleigh fading channel. Firstly, a design theoretic construction based on optical orthogonal codes [15][16][17][18][19][20][21] gives three classes of binary QC-LDPC codes with no length-4 cycles. Secondly, the proposed OOC-based construction is used to jointly design length-4 cycles free QC-LDPC codes for coded-relay cooperation, where sum-product algorithm SPA-based jointiterative decoding is used to decode the corrupted sequences coming from source or relay nodes in their respective time slots.…”

Mixed construction of OOC for optical code division multiple access networks

“…So far, there are many existence results for ‐OOC with Hamming weight (see e.g. [4–8]). In the OOCs constructed by mathematical theory, the codewords can be generated directly according to the mathematical structure.…”