Have a personal or library account? Click to login
Some bounds for the relative generalized Hamming weights of some evaluation codes Cover

Some bounds for the relative generalized Hamming weights of some evaluation codes

Open Access
|Sep 2017

References

  1. [1] O. Geil, S. Martin, R. Matsumoto, D. Ruano, and Y. Luo, Relative gene- ralized Hamming weights of one-point algebraic geometric codes, IEEE Trans. Inf. Theory 60 (10) (2014) 5938-5949.10.1109/TIT.2014.2345375
  2. [2] M. González-Sarabia, C. Renterí, Evaluation Codes Associated to Com- plete Bipartite Graphs, Int. J. Algebra 2 (2008) 163-170.
  3. [3] M. González Sarabia, J. Nava Lara, C. Renterí Márquez, and E. Sarmiento Rosales, Parameterized Codes over cycles, An. Stiint. Univ. Ovidius Constanta Ser. Mat. 21 (3) (2013) 241-255.10.2478/auom-2013-0056
  4. [4] M. González Sarabia, C. Renterí Márquez, and E. Sarmiento Rosales, Parameterized Codes over some Embedded Sets and their Applications to Complete Graphs, Math. Commun. 18 (2013) 337-391.
  5. [5] M. González Sarabia, C. Renterí Márquez, and A. J. Sánchez Hernán- dez, Minimum distance of some evaluation codes, Appl. Algebra Engrg. Comm. Comput. 24 (2013) 95-106.10.1007/s00200-013-0184-1
  6. [6] M. González Sarabia, C. Renterí Márquez, and E. Sarmiento Rosales, Projective parameterized linear codes, An. Stiint. Univ. Ovidius Con- stanta Ser. Mat. 23 (2) (2015).10.1515/auom-2015-0039
  7. [7] M. González Sarabia, and C. Renterí Márquez, Generalized Hamming weights and some parameterized codes. Submitted for publication (2015).10.1016/j.disc.2015.10.026
  8. [8] D.R. Grayson, M. Stillman: Macaulay2 (Available via anonymous ftp from math.uiuc.edu 1996).
  9. [9] F. Harary, Graph Theory (Addison-Wesley, 1971).
  10. [10] Z. Liu, W. Chen, and Y. Luo, The relative generalized Hamming weight of linear q-ary codes and their subcodes, Des. Codes Cryptogr. 48 (2) (2008) 111-123.10.1007/s10623-008-9170-1
  11. [11] H. López Hiram, C. Renterí Márquez and R.H. Villarreal, Affine carte- sian codes, Des. Codes Cryptogr. 71 (2014) 5-19.10.1007/s10623-012-9714-2
  12. [12] Y. Luo, C. Mitrpant, A.J.H. Vinck, and K. Chen, Some new characters on the wire-tap channel of type II, IEEE Trans. Inf. Theory 51 (3) (2005) 1222-1229.10.1109/TIT.2004.842763
  13. [13] J. Neves, M. Vaz Pinto, and R.H. Villarreal, Vanishing ideals over graphs and even cycles, Comm. Algebra 43 (3) (2015) 1050-1075.10.1080/00927872.2012.714025
  14. [14] J. Neves and M. Vaz Pinto, Vanishing ideals over complete multipartite graphs, J. Pure Appl. Algebra 218 (6) (2014) 1084-1094.10.1016/j.jpaa.2013.11.005
  15. [15] C. Renterí, A. Simis, and R.H. Villarreal, Algebraic methods for para- meterized codes and invariants of vanishing ideals over finite fields, Finite Fields Appl. 17 (2011) 81-104.10.1016/j.ffa.2010.09.007
  16. [16] E. Sarmiento, M. Vaz Pinto and R. H. Villarreal, The minimum distance of parameterized codes on projective tori, Appl. Algebra Engrg. Comm. Comput. 22 (4) (2011) 249-264.10.1007/s00200-011-0148-2
  17. [17] M. Vaz Pinto, and R.H. Villarreal, The degree and regularity of vanishing ideals of algebraic toric sets over fonite fields, Comm. Algebra 41 (9) (2013) 3376-3396.10.1080/00927872.2012.686643
  18. [18] V.K. Wei, Hamming weights for linear codes, IEEE Trans. Inf. Theory 37 (1991) 1412-1418.10.1109/18.133259
  19. [19] V.K. Wei, and K Yang, On the generalized Hamming weights of product codes, IEEE Trans. Inf. Theory 39 (5) (1993) 1709-1713.10.1109/18.259662
  20. [20] Z. Zhuang, Y. Luo, and B. Dai, Code constructions and existence bounds for relative generalized Hamming weight, Des. Codes Cryptogr. 69 (3) (2013) 275-297.10.1007/s10623-012-9657-7
DOI: https://doi.org/10.1515/auom-2016-0041 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 261 - 270
Submitted on: Apr 14, 2015
|
Accepted on: Jun 30, 2015
|
Published on: Sep 21, 2017
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2017 Manuel González Sarabia, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.