The minimum distance of the duals of binary irreducible cyclic codes

被引：8

作者：

Ding, CS ^{[1
]}

Helleseth, T

Niederreiter, H

Xing, CP

机构：

[1] Hong Kong Univ Sci & Technol, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China

[2] Univ Bergen, Dept Informat, N-5020 Bergen, Norway

[3] Natl Univ Singapore, Dept Math, Singapore 117543, Singapore

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2002年 / 48卷 / 10期

关键词：

codes; cyclotomy; irreducible cyclic codes;

D O I：

10.1109/TIT.2002.802593

中图分类号：

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

学科分类号：

0812 ;

摘要：

Irreducible cyclic codes have been an interesting subject of study for many years. The weight distribution of some of them have been determined. In this paper, we determine the minimum distance and certain weights of the duals of binary irreducible cyclic codes. We show that the weight distribution of these codes is determined by the cyclotomic numbers of certain order. As a byproduct, we describe a class of double-error correcting codes.

引用

页码：2679 / 2689

页数：11

共 23 条

[1]

[Anonymous], HDB CODING THEORY

[2]

[Anonymous], FINITE FIELDS TH APP

[3]

[Anonymous], J NUMBER THEORY

[4] UNIFORM CYCLOTOMY [J].

BAUMERT, LD ;

MILLS, WH ;

WARD, RL .

JOURNAL OF NUMBER THEORY, 1982, 14 (01) :67-82

[5] WEIGHTS OF IRREDUCIBLE CYCLIC CODES [J].

BAUMERT, LD ;

MCELIECE, RJ .

INFORMATION AND CONTROL, 1972, 20 (02) :158-&

[6]

Brouwer AE, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P295

[7]

Charpin P, 1998, HANDBOOK OF CODING THEORY, VOLS I & II, P963

[8] On binary cyclic codes with codewords of weight three and binary sequences with the trinomial property [J].

Charpin, P ;

Tietäväinen, A ;

Zinoviev, V .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) :421-425

[9]

Charpin P., 1997, Problems of Information Transmission, V33, P287

[10]

Cusick T. W., 1998, STREAM CIPHERS NUMBE

← 1 2 3 →