Galois LCD codes over mixed alphabets

arXiv (Cornell University)(2022)

引用 1|浏览4
暂无评分
摘要
We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of We study (Galois) linear complementary dual codes over mixed alphabets arising from finite chain rings. We give a characterization of when a given code is of this type and when it is Galois invariant. Finally, this leads to a study of the Gray image of $\mathbb{F}_p\mathbb{F}_p[\theta]$-linear codes, where $p\in\{2; 3\}$ and $\theta\neq\theta^2=0$, that provides $\mathbb{F}_p$-linear complementary dual codes.
更多
查看译文
关键词
94B05,94B60,13B02
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要