This issuePrevious ArticleNew construction methods of quaternary periodic complementary sequence setsNext ArticleAlgebraic decoding for doubly cyclic convolutional codes
It is shown that all non-full-rank FRH-codes, a class of perfect codes we define in this paper, are linearly equivalent to perfect codes obtainable by Phelps' construction. Moreover, it is shown by an example that the class of perfect FRH-codes also contains perfect codes that are not obtainable by Phelps construction.