线性码的最小距离与$α$ -不变量
Minimum distance of linear codes and the $α$-invariant
摘要：
由De Boer和Pellikaan得到的线性码的最小距离的简单解释，后来由第二作者改进，通过研究各种不同的生成的分次模得到进一步发展。我们使用交换/同调代数的方法来寻找最小距离和这种模的$α$ -不变量之间的联系。
英文摘要：
The simple interpretation of the minimum distance of a linear code obtained by De Boer and Pellikaan, and later refined by the second author, is further developed through the study of various finitely generated graded modules. We use the methods of commutative/homological algebra to find connections between the minimum distance and the $α$-invariant of such modules.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
