On the maximality of BCH codes

Francoise Levy-dit-Vehel; Simon Litsyn

On the maximality of BCH codes

Francoise Levy-dit-Vehel
, Simon Litsyn

INRIA Institut National de Recherche en Informatique et en Automatique

Research output: Contribution to conference › Paper › peer-review

Abstract

We present new bounds for the minimal length starting from which BCH codes of given minimal distance 2t + 1 have covering radius at most 2t.

Original language	English
Pages	278
Number of pages	1
Publication status	Published - 1 Jan 1995
Event	Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: 17 Sept 1995 → 22 Sept 1995

Conference

Conference	Proceedings of the 1995 IEEE International Symposium on Information Theory
City	Whistler, BC, Can
Period	17/09/95 → 22/09/95

Cite this

@conference{9f87ccaaafe24db5b67ca95a57fb61cb,

title = "On the maximality of BCH codes",

abstract = "We present new bounds for the minimal length starting from which BCH codes of given minimal distance 2t + 1 have covering radius at most 2t.",

author = "Francoise Levy-dit-Vehel and Simon Litsyn",

year = "1995",

month = jan,

day = "1",

language = "English",

pages = "278",

note = "Proceedings of the 1995 IEEE International Symposium on Information Theory ; Conference date: 17-09-1995 Through 22-09-1995",

}

TY - CONF

T1 - On the maximality of BCH codes

AU - Levy-dit-Vehel, Francoise

AU - Litsyn, Simon

PY - 1995/1/1

Y1 - 1995/1/1

N2 - We present new bounds for the minimal length starting from which BCH codes of given minimal distance 2t + 1 have covering radius at most 2t.

AB - We present new bounds for the minimal length starting from which BCH codes of given minimal distance 2t + 1 have covering radius at most 2t.

M3 - Paper

AN - SCOPUS:0029201917

SP - 278

T2 - Proceedings of the 1995 IEEE International Symposium on Information Theory

Y2 - 17 September 1995 through 22 September 1995

ER -

On the maximality of BCH codes

Abstract

Conference

Fingerprint

Cite this