“…7]. This generalizes the asymptotic properties of self-dual double-circulant codes [3], and of self-dual negacirculant codes [4,24]. The proof is restricted to F 2 where we can show that an infinite family of irreducible trinomials exists.…”
Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical examples show that the codes constructed have optimal or quasi-optimal parameters amongst formally self-dual codes. Self-duality, the trivial case of isoduality, can only occur over F 2 in the double circulant case. Building on an explicit infinite sequence of irreducible trinomials over F 2 , we show that binary double polycirculant codes are asymptotically good.
“…7]. This generalizes the asymptotic properties of self-dual double-circulant codes [3], and of self-dual negacirculant codes [4,24]. The proof is restricted to F 2 where we can show that an infinite family of irreducible trinomials exists.…”
Double polycirculant codes are introduced here as a generalization of double circulant codes. When the matrix of the polyshift is a companion matrix of a trinomial, we show that such a code is isodual, hence formally self-dual. Numerical examples show that the codes constructed have optimal or quasi-optimal parameters amongst formally self-dual codes. Self-duality, the trivial case of isoduality, can only occur over F 2 in the double circulant case. Building on an explicit infinite sequence of irreducible trinomials over F 2 , we show that binary double polycirculant codes are asymptotically good.
“…Proof By the Gray map over R k , we see that the Gray image of the several families of codes of length 2m are linear codes of length 2mp k−1 . Combining Lemmas 3.4, 4.1, 4.2, 4.3, 4.4 and Theorem 3.9, the result follows by the same method as Theorem 5.2 in [20], so we omit the detailed proof here.…”
In this work, we describe a double bordered construction of self-dual codes from group rings. We show that this construction is effective for groups of order 2p where p is odd, over the rings F 2 + uF 2 and F 4 + uF 4. We demonstrate the importance of this new construction by finding many new binary self-dual codes of lengths 64, 68 and 80; the new codes and their corresponding weight enumerators are listed in several tables. Keywords Group rings • Self-dual codes • Codes over rings • Extremal codes • Bordered constructions Mathematics Subject Classification (2010) 94B05 • 94B15 This research was supported by the London Mathematical Society (International Short Visits-Scheme 5).
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.