线性码在分量乘下的乘积和幂
On products and powers of linear codes under componentwise multiplication
摘要:
本文给出了线性码在分量乘法下的乘积和幂的形式。作为作者在AGCT-14上演讲的扩展版本,重点主要放在基本属性和描述性陈述上,否则可能不适合常规研究论文。另一方面,更先进的结果和应用只是很快提到的参考文献。我们还指出了一些开放的问题。我们的演示文稿交替两个观点,理论交织在一个重要的方式:组合编码,代数几何。在可以独立阅读的附录中,我们研究了有限域上的多线性代数中的主题,特别是我们建立了一个对称多线性映射的标准,以允许对称算法,或者等价地,对称张量分解为初等对称张量的总和。
英文摘要:
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that could otherwise probably not fit in a regular research paper. On the other hand, more advanced results and applications are only quickly mentioned with references to the literature. We also point out a few open problems. Our presentation alternates between two points of view, which the theory intertwines in an essential way: that of combinatorial coding, and that of algebraic geometry. In appendices that can be read independently, we investigate topics in multilinear algebra over finite fields, notably we establish a criterion for a symmetric multilinear map to admit a symmetric algorithm, or equivalently, for a symmetric tensor to decompose as a sum of elementary symmetric tensors.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。