The Two Covering Radius of the Two Error Correcting BCH Code

Andrew Klapper; Andrew Mertz

The Two Covering Radius of the Two Error Correcting BCH Code

Andrew Klapper, Andrew Mertz

Eastern Illinois University

University of Kentucky

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

Abstract

The m-covering radii of codes are natural generalizations of the covering radii of codes. In this paper we analyze the 2-covering radii of double error correcting BCH code.

Original language	American English
Journal	Advances in Mathematics of Communications
Volume	3
State	Published - 2009

Disciplines

Computer Sciences
Mathematics

Access to Document

fulltext.pdfFinal published version, 167 KBLicense: Unspecified

Cite this

@article{ac60dc205fd8486cb5a640a5bc552bdb,

title = "The Two Covering Radius of the Two Error Correcting BCH Code",

abstract = " The m-covering radii of codes are natural generalizations of the covering radii of codes. In this paper we analyze the 2-covering radii of double error correcting BCH code.",

author = "Andrew Klapper and Andrew Mertz",

year = "2009",

language = "American English",

volume = "3",

journal = "Advances in Mathematics of Communications",

}

TY - JOUR

T1 - The Two Covering Radius of the Two Error Correcting BCH Code

AU - Klapper, Andrew

AU - Mertz, Andrew

PY - 2009

Y1 - 2009

N2 - The m-covering radii of codes are natural generalizations of the covering radii of codes. In this paper we analyze the 2-covering radii of double error correcting BCH code.

AB - The m-covering radii of codes are natural generalizations of the covering radii of codes. In this paper we analyze the 2-covering radii of double error correcting BCH code.

M3 - Article

VL - 3

JO - Advances in Mathematics of Communications

JF - Advances in Mathematics of Communications

ER -