Polyphase alternating codes

This work introduces a method for constructing polyphase alternating codes in which the length of a code transmission cycle can be $p^m$ or $p-1$, where $p$ is a prime number and $m$ is a positive integer. The relevant properties leading to the construction alternating codes and the algorithm for generating alternating codes is described. Examples of all practical and some not that practical polyphase code lengths are given.

💡 Research Summary

The paper presents a comprehensive framework for constructing polyphase alternating codes whose sequence lengths can be either (p^m) or (p-1), where (p) is a prime number and (m) is a positive integer. Alternating codes are known for their excellent autocorrelation properties, making them valuable in radar and communication applications that require low sidelobes and high range resolution. Traditional binary alternating codes, however, are limited to lengths of the form (2^m) or (2^m-1), restricting flexibility in system design. By moving to a polyphase (multi‑phase) representation, the authors extend the admissible lengths dramatically while preserving the desirable correlation characteristics.

The theoretical development begins with a review of finite field theory. For a given prime (p) and integer (m), the field (\mathrm{GF}(p^m)) possesses a primitive element (\alpha) whose powers generate all non‑zero field elements. Mapping each field element to a complex (p)-phase symbol via the function \