ON THE COVERING RADIUS OF CODES

被引：134

作者：

GRAHAM, RL

SLOANE, NJA

机构：

[1] AT&T Bell Lab, Murray Hill, NJ,, USA, AT&T Bell Lab, Murray Hill, NJ, USA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1985年 / 31卷 / 03期

关键词：

D O I：

10.1109/TIT.1985.1057039

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：385 / 401

页数：17

共 29 条

[1] PREDICTIVE CODING OF SPEECH AT LOW BIT RATES [J].

ATAL, BS .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1982, 30 (04) :600-614

[2]

ATAL BS, COMMUNICATION

[3] BALANCING MATRICES WITH LINE SHIFTS [J].

BECK, J ;

SPENCER, J .

COMBINATORICA, 1983, 3 (3-4) :299-304

[4]

BERGER T, 1971, RATE DISTORITION THE

[5] MINIMIZATION OF +/-1 MATRICES UNDER LINE SHIFTS [J].

BROWN, TA ;

SPENCER, JH .

COLLOQUIUM MATHEMATICUM, 1971, 23 (01) :165-&

[6] A NONCONSTRUCTIVE UPPER BOUND ON COVERING RADIUS [J].

COHEN, GD .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1983, 29 (03) :352-353

[7] COVERING RADIUS - SURVEY AND RECENT RESULTS [J].

COHEN, GD ;

KARPOVSKY, MG ;

MATTSON, HF ;

SCHATZ, JR .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1985, 31 (03) :328-343

[8]

DAVENPORT H, 1956, REND CIRC MAT PALE 2, V5, P1

[9]

FELLER W, 1957, INTRO POBABILITY THE, V1

[10]

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

← 1 2 3 →