Locally recoverable codes from algebraic curves and surfaces
Locally recoverable codes from algebraic curves and surfaces
复制标题
DOI：
10.1007/978-3-319-63931-4_4
复制
发表时间：
2017-01
期刊：
影响因子：
--
通讯作者：
A. Barg;Kathryn Haymaker;Everett W. Howe;Gretchen L. Matthews;Anthony Várilly-Alvarado
中科院分区：
文献类型：
--
作者：
A. Barg;Kathryn Haymaker;Everett W. Howe;Gretchen L. Matthews;Anthony Várilly-Alvarado
有限域Fq上的长度码是线性空间Fq n的子集。如果该码形成Fqn的线性子空间，则称之为linear。码的最小距离d是汉明度量中两个不同元素之间的最小成对间隔，如果码是线性的，则d等于非零码字的最小汉明重量。我们用符号（n，k，d）表示长度最小距离的线性k维码的参数。
A codeof lengthnover a finite fieldFqis a subset of the linear spaceFqn. The code is calledlinearif it forms a linear subspace ofFqn. Theminimum distance dof a code is the minimum pairwise separation between two distinct elements ofin the Hamming metric, and if the codeis linear, thendis equal to the minimum Hamming weight of a nonzero codeword of. We use the notation (n,k,d) to refer to the parameters of a lineark-dimensional code of lengthnand minimum distanced.