Fu Fangwei, Shen Shiyi . ON THE MEAN VALUE AND VARIANCE OF DISTANCE DISTRIBUTION OF NON-LINEAR CODES IN GF(q)[J]. Journal of Electronics & Information Technology, 1997, 19(1): 56-60.
Citation:
Fu Fangwei, Shen Shiyi . ON THE MEAN VALUE AND VARIANCE OF DISTANCE DISTRIBUTION OF NON-LINEAR CODES IN GF(q)[J]. Journal of Electronics & Information Technology, 1997, 19(1): 56-60.
Fu Fangwei, Shen Shiyi . ON THE MEAN VALUE AND VARIANCE OF DISTANCE DISTRIBUTION OF NON-LINEAR CODES IN GF(q)[J]. Journal of Electronics & Information Technology, 1997, 19(1): 56-60.
Citation:
Fu Fangwei, Shen Shiyi . ON THE MEAN VALUE AND VARIANCE OF DISTANCE DISTRIBUTION OF NON-LINEAR CODES IN GF(q)[J]. Journal of Electronics & Information Technology, 1997, 19(1): 56-60.
This paper presents lower bounds and upper bounds for the mean value and variance of distance distribution of non-linear codes in GF(q). By presenting several examples, it is shown that these bounds could be achieved.
王新梅.最佳(n, 2, w)二进制等重纠错码的存在性和猜想.中国科学(A辑), 1987, 17(11): 1225-1232.[2]王新梅.非线性等重码的不可检错误概率.电子学报,1989, 17(1): 8-14.[3]王新梅.非线性等重码检错性能的进一步分析.通信学报,1992, 13(4): 10-17.[4]杨义先.截短Hamming码和截短R-M码的不可检错误概率.通信学报,1991, 12(4): 38-45.[5]Althofer I, Sillke T. An average distance inequality for large subsets of the cube. Journal of Combinatorial Theory, 1992, 56B(2): 296-301.[6]Van Lint J H. Introduction to Coding Theory, Graduate Texts in Mathematics. Berlin:Springer-Verlag, 1982, 13-15.[7]Roman S. Coding and Information Theory, Graduate Texts in Mathematics. Berlin: Springer-Verlag, 1991, 220-237.