Balanced orthogonal code for polarization angle diversity

A special code is studied that discriminates finite areas of equal length. This code, which includes an equal number of positive and negative unity bits, has balanced characteristics. The subset of the balanced codes that have characteristics orthogonal to each other is useful for discriminating the finite areas. Such a subset is found by the brute force method and the proposed algorithm that generates the balanced codes in short calculation time. A numerical search for this subset of the orthogonal balanced codes shows that the codes 2^2m+1 long provide a subset that has three components and that those 2^2m long are only able to create the subsets whose the number of components increases by expanding the code length. An algorithm is proposed that generates the orthogonal balanced codes. Variations of the subsets of orthogonal balance codes become huge when the code is long. The proposed algorism generates examples of a subset created very quickly by using recurrence procedure and an initial subset that consists of a small number of orthogonal balance codes. The subset that the proposed algorism generates is useful for discriminating the divided areas of the polarization angle because the balanced characteristic does not need the stable ground that the electromagnetic wave causes.