References
- S. M. Dodunekov, I. N. Landgev, On near-MDS codes, J.Geom. 54(1995), pp. 30–43 doi: 10.1007/BF01222850
- T. Kasami, T. Tanaka, T. Fujiwara, S. Lin, On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes, IEEE Trans. Inform. Theory. 39 (1993), pp. 242–245 doi: 10.1109/18.179366
- S. Ling, C. P. Xing, Coding Theory, A First Course, Cambridge University Press, Oxford, 2004
- V. S. Pless, W. C. Huffman, R. A. Brualdi, An introduction to algebraic codes, Handbook of Coding Theory, Volnum I, V. S. Pless, W. C. Huffman, eds., Elsevier, Amsterdam, 1998
- H. Stichtenoth, Algebraic Function Fields and Codes, Springer, Berlin, 1993
- H. X. Tong, NNMDS codes, J. Syst Sci Complex. 25, (2012), pp. 617–624 doi: 10.1007/s11424-012-0041-5
- M. A. Tsfasman, S. G. Vladut, Geometric approach to higher weights, IEEE Trans. Inform. Theory, 41 (1995), pp. 1564–1588 doi: 10.1109/18.476213
- V. K. Wei, Generalized Hamming weights for linear codes, IEEE Trans. Inform. Theory, 37 (1991), pp. 1412–1418 doi: 10.1109/18.133259