This report is a continuation of two previous reports dealing with so-called constacyclotomic cosets and constacyclonomials of constacyclic codes. These notions are studied more closely and applied to the special case of negacyclic case. A digraph is defined such that its leaves correspond to negacyclotomic cosets and its internal vertices to negacyclonomials. This graph appears to consist of the union of disconnected subtrees. It is proved that the number of negacyclotomic cosets is equal to the number of negacyclonomials in each subtree, and therefore also for the complete graph itself.
|Number of pages||27|
|Publication status||Published - 2015|