Linear codes with complementary duals

Linear codes with complementary duals
复制标题

DOI:
10.1016/0012-365x(92)90563-u
复制
发表时间:
1992-10
期刊:
Discret. Math.
影响因子:
--
通讯作者:
J. Massey
J. Massey
中科院分区:
其他
文献类型:
--
作者:
J. Massey

文献摘要

被引文献

相似文献

具有互补对偶的线性码(或LCD码)被定义为线性码C,其对偶码C满足C C ={0}。给出了LCD码的代数特征,证明了存在渐近好的LCD码。LCD代码示出为两个用户的二进制加法器通道提供最佳的线性编码解决方案。LCD码的最近邻(或最大似然)解码问题被简化为:给定C语言中的一个字,在C语言中找到最近的码字。
A linear code with a complementary dual (or an LCD code) is defined to be a linear code C whose dual code C⊥ satisfies C∩ C⊥={0}. The algebraic characterization of LCD codes is given, and it is shown that asymptotically good LCD codes exist. LCD codes are shown to provide an optimum linear coding solution for the two-user binary adder channel. The nearest-neighbor (or maximum-likelihood) decoding problem for LCD codes is shown to reduce to the problem: given a word in C⊥, find the nearest codeword in C.