Idempotents and the BCH Bound

Daniel Augot; Nicolas Sendrier

doi:10.1109/18.272483

Idempotents and the BCH Bound

Daniel Augot
, Nicolas Sendrier

INRIA Institut National de Recherche en Informatique et en Automatique

Research output: Contribution to journal › Article › peer-review

Abstract

Using a characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table.

Original language	English
Pages (from-to)	204-207
Number of pages	4
Journal	IEEE Transactions on Information Theory
Volume	40
Issue number	1
DOIs	https://doi.org/10.1109/18.272483
Publication status	Published - 1 Jan 1994

Keywords

BCH codes
idempotents
locator polynomial
minimum distance
splitting field

Access to Document

10.1109/18.272483

Cite this

@article{4a5896aadcc34906833a07e10069737f,

title = "Idempotents and the BCH Bound",

abstract = "Using a characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table.",

keywords = "BCH codes, idempotents, locator polynomial, minimum distance, splitting field",

author = "Daniel Augot and Nicolas Sendrier",

year = "1994",

month = jan,

day = "1",

doi = "10.1109/18.272483",

language = "English",

volume = "40",

pages = "204--207",

journal = "IEEE Transactions on Information Theory",

issn = "0018-9448",

number = "1",

}

TY - JOUR

T1 - Idempotents and the BCH Bound

AU - Augot, Daniel

AU - Sendrier, Nicolas

PY - 1994/1/1

Y1 - 1994/1/1

N2 - Using a characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table.

AB - Using a characterization of the idempotents of a narrow-sense primitive binary BCH code, we are able to give classes of such codes whose minimum distance does not exceed the BCH bound. Our results are compiled in a table.

KW - BCH codes

KW - idempotents

KW - locator polynomial

KW - minimum distance

KW - splitting field

UR - https://www.scopus.com/pages/publications/0028202723

U2 - 10.1109/18.272483

DO - 10.1109/18.272483

M3 - Article

AN - SCOPUS:0028202723

SN - 0018-9448

VL - 40

SP - 204

EP - 207

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

IS - 1

ER -

Idempotents and the BCH Bound

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this