关于Kronecker积和距离的界
On a Kronecker products sum distance bounds
摘要：
研究了一类由两个码族Kronecker乘积和表示的二元线性纠错码.研究了新码的维数和距离。得到了距离的上界和下界。文中给出了一些实例。证明了一些经典构式是所考虑构式的私人情形。具有相等的上下限距离的代码的子类被分配。
英文摘要：
A binary linear error correcting codes represented by two code families Kronecker products sum are considered. The dimension and distance of new code is investigated. Upper and lower bounds of distance are obtained. Some examples are given. It is shown that some classic constructions are the private cases of considered one. The subclass of codes with equal lower and upper distance bounds is allocated.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
