On the information function of an error-correcting code

被引：24

作者：

Helleseth, T ^{[1
]}

Klove, T ^{[1
]}

Levenshtein, VI ^{[1
]}

机构：

[1] MV KELDYSH APPL MATH INST,MOSCOW 125047,RUSSIA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1997年 / 43卷 / 02期

关键词：

information function; linear code; support weight; weight hierarchy;

D O I：

10.1109/18.556112

中图分类号：

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

学科分类号：

0812 ;

摘要：

The information function e(h) of a code is the average amount of information contained in h positions of the codewords. Upper and lower bounds on the information function of binary linear codes are given. The average value and variance of the information function over all [n, k] codes are determined.

引用

页码：549 / 557

页数：9

共 12 条

[1]

[Anonymous], 1965, MATH SCAND

[2]

CARLITZ L, 1966, MATH SCAND, V19, P38

[3]

Clark G.C., 1981, Error-Correction Coding for Digital Communications

[4] DIMENSION LENGTH PROFILES AND TRELLIS COMPLEXITY OF LINEAR BLOCK-CODES [J].