Abstract
Code alphabets whose characters can be represented by a finite sequence of digits of value +1 or −1 have been extensively investigated. The characters of these binary codes may be considered to be superpositions of orthogonal functions, one for each digit, which are multiplied by +1 or −1. A character of an orthogonal code consists of one function of a set of orthogonal functions multiplied by +1 or −1.

This publication has 0 references indexed in Scilit: