十六种新的Plotkin和线性码
Sixteen New Linear Codes With Plotkin Sum
摘要：
提出了16个新的线性码：其中三个改进了线性码的最小距离的下界，其余的是一个显式的未知码的建设达到最小距离的下界。它们使用两个线性码的Plotkin和构造，也称为$(u|u+v)$构造。计算是使用穷举搜索实现的。
英文摘要：
Sixteen new linear codes are presented: three of them improve the lower bounds on the minimum distance for a linear code and the rest are an explicit construction of unknown codes attaining the lower bounds on the minimum distance. They are constructed using the Plotkin sum of two linear codes, also called $(u|u+v)$ construction. The computations have been achieved using an exhaustiv search.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
