IDENTITIES AND APPROXIMATIONS FOR THE WEIGHT DISTRIBUTION OF Q-ARY CODES

被引：5

作者：

CHEUNG, KM

机构：

[1] Jet Propulsion Laboratory, Pasadena, CA 91109, 238-420

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1990年 / 36卷 / 05期

关键词：

D O I：

10.1109/18.57216

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An explicit formula is derived that enumerates the complete weight distribution of an (n,k,d) linear code using a partially known weight distribution. An approximation formula for the weight distribution of fl-ary linear (n,k,d) codes is also derived. It is shown that for a given q-ary linear (n,k,d) code, the ratio of the number of codewords of weight u to the number of words of weight u approaches the constant Q = q -(n-k) as u becomes large. The error term is a decreasing function of the minimum weight of the dual. The results are also valid for nonlinear (n,M,d) codes with the minimum weight of the dual replaced by the dual distance. © 1990 IEEE

引用

页码：1149 / 1153

页数：5

共 8 条

[1] BERLEKAMP ER, 1977, ALGEBRAIC CODING THE
[2] 4 FUNDAMENTAL PARAMETERS OF A CODE AND THEIR COMBINATORIAL SIGNIFICANCE
DELSARTE, P
[J]. INFORMATION AND CONTROL, 1973, 23 (05): : 407 - 438
[3] AN APPROXIMATION TO THE WEIGHT DISTRIBUTION OF BINARY LINEAR CODES
KASAMI, T
FUJIWARA, T
LIN, S
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (06) : 769 - 780
[4] Macwilliams F. J., 1977, THEORY ERROR CORRECT
[5] PLESS V, 1963, INFORM CONTR, P147
[6] SIDELNIKOV VM, 1971, PROBL PEREDACHI INF, V7, P14
[7] ON THE WEIGHT DISTRIBUTION OF LINEAR CODES HAVING DUAL DISTANCE D'-GREATER-THAN-OR-EQUAL-TO-K
STAIGER, L
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1989, 35 (01) : 186 - 188
[8] Stanley R.P, 1986, ENUMERATIVE COMBINAT, V1

← 1 →