Some new upper bounds on the covering radius of binary linear codes

IEEE Transactions on Information Theory ◽

10.1109/18.42182 ◽

1989 ◽

Vol 35 (1) ◽

pp. 110-122 ◽

Author(s):

H. Janwa

Keyword(s):

Linear Codes ◽

Upper Bounds ◽

Covering Radius ◽

Binary Linear Codes

Download Full-text

Do most binary linear codes achieve the Goblick bound on the covering radius? (Corresp.)

IEEE Transactions on Information Theory ◽

10.1109/tit.1986.1057249 ◽

1986 ◽

Vol 32 (6) ◽

pp. 826-828 ◽

Author(s):

P. Delsarte ◽

P. Piret

Keyword(s):

Linear Codes ◽

Covering Radius ◽

Binary Linear Codes

Download Full-text

On the least covering radius of binary linear codes with small lengths

IEEE Transactions on Information Theory ◽

10.1109/tit.2002.808099 ◽

2003 ◽

Vol 49 (3) ◽

pp. 738-740

Author(s):

T. Baicheva ◽

V. Vavrek

Keyword(s):

Linear Codes ◽

Covering Radius ◽

Binary Linear Codes

Download Full-text

On the covering radius of binary, linear codes meeting the Griesmer bound

IEEE Transactions on Information Theory ◽

10.1109/tit.1985.1057073 ◽

1985 ◽

Vol 31 (4) ◽

pp. 465-468 ◽

Author(s):

P. Busschbach ◽

M. Gerretzen ◽

H. van Tilborg

Keyword(s):

Linear Codes ◽

Covering Radius ◽

Griesmer Bound ◽

Binary Linear Codes

Download Full-text

Refined upper bounds on stopping redundancy of binary linear codes

2015 IEEE Information Theory Workshop (ITW) ◽

10.1109/itw.2015.7133087 ◽

2015 ◽

Author(s):

Yauhen Yakimenka ◽

Vitaly Skachek

Keyword(s):

Linear Codes ◽

Upper Bounds ◽

Binary Linear Codes

Download Full-text

New Upper Bounds on Binary Linear Codes and a $ {\mathbb Z}_{4}$ -Code With a Better-Than-Linear Gray Image

IEEE Transactions on Information Theory ◽

10.1109/tit.2016.2612654 ◽

2016 ◽

Vol 62 (12) ◽

pp. 6768-6771

Author(s):

Michael Kiermaier ◽

Alfred Wassermann ◽

Johannes Zwanzger

Keyword(s):

Linear Codes ◽

Upper Bounds ◽

Binary Linear Codes ◽

Download Full-text

On the least covering radius of binary linear codes of dimension 6

Advances in Mathematics of Communications ◽

10.3934/amc.2010.4.399 ◽

2010 ◽

Vol 4 (3) ◽

pp. 399-404 ◽

Author(s):

Tsonka Baicheva ◽

◽

Iliya Bouyukliev

Keyword(s):

Linear Codes ◽

Covering Radius ◽

Binary Linear Codes

Download Full-text

Granular Gain of Low-Dimensional Lattices from Binary Linear Codes

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e95.a.2168 ◽

2012 ◽

Vol E95.A (12) ◽

pp. 2168-2170

Author(s):

Misako KOTANI ◽

Shingo KAWAMOTO ◽

Motohiko ISAKA

Keyword(s):

Linear Codes ◽

Binary Linear Codes ◽

Low Dimensional

Download Full-text

ON R-LINEAR CODES AND ITS COVERING RADIUS OF SOME CLASSES OF LINEAR CODES IN R

Advances in Mathematics: Scientific Journal ◽

10.37418/amsj.9.3.42 ◽

2020 ◽

Vol 9 (3) ◽

pp. 1159-1176

Author(s):

P. Chella Pandian ◽

J. Mahalakshmi

Keyword(s):

Linear Codes ◽

Covering Radius

Download Full-text

Simple Tight Performance Bound Based on the GFBT for Binary Linear Codes

IOP Conference Series Earth and Environmental Science ◽

10.1088/1755-1315/428/1/012028 ◽

2020 ◽

Vol 428 ◽

pp. 012028

Author(s):

Jia Liu ◽

Mingyu Zhang ◽

Rongjun Chen ◽

Chaoyong Wang ◽

Xiaofeng An ◽

...

Keyword(s):

Linear Codes ◽

Performance Bound ◽

Binary Linear Codes

Download Full-text

An updated table of minimum-distance bounds for binary linear codes

IEEE Transactions on Information Theory ◽

10.1109/tit.1987.1057356 ◽

1987 ◽

Vol 33 (5) ◽

pp. 665-680 ◽

Author(s):

T. Verhoeff

Keyword(s):

Minimum Distance ◽

Linear Codes ◽

Binary Linear Codes

Download Full-text