The minimum distance of parameterized codes on projective tori

被引:0
|
作者
Eliseo Sarmiento
Maria Vaz Pinto
Rafael H. Villarreal
机构
[1] Centro de Investigación y de Estudios Avanzados del IPN,Departamento de Matemáticas
[2] Instituto Superior Tecnico,Departamento de Matemática
[3] Universidade Técnica de Lisboa,undefined
关键词
Complete intersections; Evaluation codes; Parameterized codes; Minimum distance; Degree; Regularity; Hilbert function; Primary 13P25; Secondary 14G50; 14G15; 11T71; 94B27; 94B05;
D O I
暂无
中图分类号
学科分类号
摘要
Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus. In this case we determine the minimum distance of any parameterized linear code arising from X.
引用
收藏
页码:249 / 264
页数:15
相关论文
共 50 条
  • [21] A NOTE ON THE MINIMUM DISTANCE OF HERMITIAN CODES
    XING, CP
    [J]. CHINESE SCIENCE BULLETIN, 1992, 37 (02): : 95 - 99
  • [22] Minimum distance of some evaluation codes
    Manuel González Sarabia
    Carlos Rentería Márquez
    Antonio J. Sánchez Hernández
    [J]. Applicable Algebra in Engineering, Communication and Computing, 2013, 24 : 95 - 106
  • [23] Minimum distance of some evaluation codes
    Gonzalez Sarabia, Manuel
    Renteria Marquez, Carlos
    Sanchez Hernandez, Antonio J.
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2013, 24 (02) : 95 - 106
  • [24] On the minimum distance conjecture for Schubert codes
    Xiang, Xu
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (01) : 486 - 488
  • [25] On Tanner codes: Minimum distance and decoding
    Janwa, H
    Lal, AK
    [J]. APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2003, 13 (05) : 335 - 347
  • [26] Minimum Distance Bounds for Expander Codes
    Skachek, Vitaly
    [J]. 2008 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2008, : 409 - 413
  • [27] On Minimum Distance of Locally Repairable Codes
    Mehrabi, Mehrtash
    Ardakani, Masoud
    [J]. 2017 15TH CANADIAN WORKSHOP ON INFORMATION THEORY (CWIT), 2017,
  • [28] On the minimum distance of elliptic curve codes
    Li, Jiyou
    Wan, Daqing
    Zhang, Jun
    [J]. 2015 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2015, : 2391 - 2395
  • [29] Minimum distance of linear codes and the α-invariant
    Garrousian, Mehdi
    Tohaneanu, Stefan O.
    [J]. ADVANCES IN APPLIED MATHEMATICS, 2015, 71 : 190 - 207
  • [30] On the minimum distance of binary concatenated codes
    Kohnosu, T
    Nishijima, T
    Hirasawa, S
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (05) : 922 - 923