The two covering radius of the two error correcting BCH code

Andrew Klapper; Andrew Mertz

doi:10.3934/amc.2009.3.83

Article Contents

2009, Volume 3, Issue 1: 83-95. Doi: 10.3934/amc.2009.3.83

This issue Previous Article A new almost perfect nonlinear function which is not quadratic Next Article Edge number, minimum degree, maximum independent set, radius and diameter in twin-free graphs

The two covering radius of the two error correcting BCH code

Andrew Klapper^1, and
Andrew Mertz^2,

1.
University of Kentucky, 779A F. Paul Anderson Tower, Lexington, KY 40506-0046
2.
Eastern Illinois University, 600 Lincoln Avenue, Charleston, IL 61920-3099

Received: September 30, 2008

Revised: December 31, 2008

Published: January 2009

Abstract Related Papers Cited by

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. In particular, we show that the 2-covering radius of the double error correcting BCH code is $(n+1)/2$ for sufficiently large $n$.

Keywords:

Mathematics Subject Classification: Primary: 94B05, 94B75.

Citation:

Article Metrics

HTML views() PDF downloads(91) Cited by(0)

The two covering radius of the two error correcting BCH code

Abstract

Access History

Article Metrics

Access History

Other Articles By Authors

Catalog

The two covering radius of the two error correcting BCH code

Abstract

Access History

SHARE

Article Metrics

Access History

Other Articles By Authors

Catalog

Export File

Citation

Format

Content