Binary non-antipodal completely regular codes are characterized. Using the result on nonexistence of nontrivial binary perfect codes, it is concluded that there are no unknown nontrivial non-antipodal completely regular binary codes with minimum distance d ≥ 3. The only such codes are halves and punctered halves of known binary perfect codes. Thus, new such codes with covering radiuses ρ = 2, 3...

A sequence is called perfect if its autocorrelation function is a delta function. In this paper, we give a new definition of autocorrelation function: generalized even and odd periodic autocorrelation, and generalized even and odd periodic cyclically conjugated autocorrelation. In particular, we study a special case of autocorrelation function called cyclically conjugated autocorrelation functi...

Recently, some table-lookup decoding algorithms (TLDAs) have been used to correct the binary Golay code. This paper proposes an efficient high-speed TLDA called message-syndrome decoding algorithm (MSDA) by using the message syndrome to correct the binary systematic Golay code. The proposed MSDA is based on the novel message-syndrome lookup table (MSLT). The MSLT merely consists of 12 candidate...

A pair of two sequences is called the even periodic (odd periodic) complementary sequence pair if the sum of their even periodic (odd periodic) correlation function is a delta function. The wellknown Golay aperiodic complementary sequence pair (Golay pair) is a special case of even periodic (odd periodic) complementary sequence pair. In this paper, we presented several classes of even periodic ...

In this paper we transmit different complimentary codes using QPSK (Quadrature phase shift keying) modulation technique. The signal which is transmitted is scattered back from the target and send to the receiver for the demodulation. Using matlab a digital processing algorithm is designed for resolving range resolution and Doppler localization of a target using different complimentary codes lik...

Suppose G is a connected, k-regular graph such that Spec…G† ˆ Spec…G† where G is a distance-regular graph of diameter d with parameters a1 ˆ a2 ˆ ˆ adÿ1 ˆ 0 and ad > 0; i.e., a generalized odd graph, we show that G must be distance-regular with the same intersection array as that of G in terms of the notion of Ho ̈man Polynomials. Furthermore, G is isomorphic to G if G is one of the odd polygon ...

Sir: In 1964 a paper by Savitzky and Golay ( I ) describing a technique of smoothing and obtaining smoothed derivatives using convolution arrays derived from the coefficients of least-squares-fit formulas was published in this journal. That paper has become a classic judging by the number of citations @-well over 350 in more than 100 different journals-since its publication despite the fact tha...