CONSTRUCTION OF SELF-DUAL RADICAL 2-CODES OF GIVEN DISTANCE
Carolin Hannusch, Piroska Lakatos · Discrete Mathematics Algorithms and Applications · 2012
We prove that for arbitrary n ∈ ℕ and [Formula: see text] and for a field K of characteristic 2 there exists an abelian group G of order 2n such that one of the powers of the radical of the group algebra K[G] is a (2n, 2n-1, 2d)-self-dual code. These codes are constructed for abelian groups G with decomposition [Formula: see text] where a1 ≥ 3 and si ≥ 0(1 ≤ i ≤ 3).