OPTIMAL CODES FOR ERROR-DETECTION

被引：7

作者：

KLOVE, T

机构：

[1] Department of Informatics, University of Bergen, N-5020, Bergen, Hϕgeteknologisenterel

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1992年 / 38卷 / 02期

基金：

美国国家科学基金会;

关键词：

LINEAR CODES; ERROR DETECTION; WEIGHT DISTRIBUTION;

D O I：

10.1109/18.119708

中图分类号：

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

学科分类号：

0812 ;

摘要：

The probability of undetected error for codes over GF (2m) having a generator matrix over GF (2) is studied. The optimal codes of dimensions four or less are determined. For higher dimensions, we determine some properties of optimal codes.

引用

页码：479 / 489

页数：11

共 7 条

[1]

FONTAINE AB, 1959, IEEE T INFORM THEORY, V5, P60

[2] MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES [J].

HELGERT, HJ ;

STINAFF, RD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1973, 19 (03) :344-356

[3] WEIGHT DISTRIBUTION OF IRREDUCIBLE CYCLIC CODES WITH BLOCK LENGTHS N1((Q1-1)-N) [J].

HELLESETH, T ;

KLOVE, T ;

MYKKELTVEIT, J .

DISCRETE MATHEMATICS, 1977, 18 (02) :179-211

[4]

KORZHIK V, RADIOTECHNIKA 20, V1, P27

[5]

PADOVANI R, GLOBECOM 82, P626

[6] AN UPDATED TABLE OF MINIMUM-DISTANCE BOUNDS FOR BINARY LINEAR CODES [J].

VERHOEFF, T .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1987, 33 (05) :665-680

[7] ON THE PROBABILITY OF UNDETECTED ERROR FOR LINEAR BLOCK-CODES [J].

WOLF, JK ;

MICHELSON, AM ;

LEVESQUE, AH .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (02) :317-324

← 1 →