Polyphase alternating codes
Markku Markkanen, Juha Vierinen
TL;DR
This paper presents a method for constructing polyphase alternating codes with lengths based on prime powers or prime minus one, including an algorithm and practical examples.
Contribution
It introduces a novel construction method for polyphase alternating codes with specific lengths and provides an algorithm and examples for their generation.
Findings
Constructed codes for lengths p^m and p-1 where p is prime.
Provided an algorithm for generating these codes.
Presented practical and some impractical code examples.
Abstract
This work introduces a method for constructing polyphase alternating codes in which the length of a code transmission cycle can be or , where is a prime number and 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.