Linear codes that meet their dual trivially are also known as linear complementary dual codes. Quasi-abelian complementary dual codes are characterized using a known decomposition of a semisimple group algebra. Consequently, enumeration of such codes are obtained. More explicit formulas are given for the number of quasi-abelian complementary dual codes of index 2 with respect to Euclidean and Hermitian inner products. A sequence of asymptotically good binary quasi-abelian complementary dual codes of index 3 is constructed from an existing sequence of asymptotically good binary self-dual quasi-abelian codes of index 2.
展开▼
机译：部分参数[n i ]＆[m j ] f（h）↓CD 的部分乘积模拟信号的有序序列的生成方法乘数± [n i ] f（2 n ）和± [m j ] f（2 n ）-金字塔乘数f Σ（↓ CD Σ）中的“互补代码”，用于连续逻辑减法f 1 （CD↓）并以格式± [S Σ] f（2 n ）生成结果和-“补充代码”及其实现的功能结构（俄罗斯逻辑版本）
