2005Journal of Xi'an University of Science and TechnologyRequires access

Construction of BCH code over Z_p~k

Jianfa Qian

Open publisher page 0 citations

Abstract

BCH codes are of great practical importance for error correction.It has good structure of algebra.For a BCH code of length n=p~m-1 and design distance over F_p,we lift its generator polynomial,and construct a BCH code over Z_(p~k).Moreover,the distance of new BCH code is at least d.

About this research paper

What this paper is about

BCH codes are of great practical importance for error correction.It has good structure of algebra.For a BCH code of length n=p~m-1 and design distance over F_p,we lift its generator polynomial,and construct a BCH code over Z_(p~k).Moreover,the distance of new BCH code is at least d.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

BCH codes are of great practical importance for error correction.It has good structure of algebra.For a BCH code of length n=p~m-1 and design distance over F_p,we lift its generator polynomial,and construct a BCH code over Z_(p~k).Moreover,the distance of new BCH code is at least d.

Key concepts: BCH code, Polynomial code, Reed–Solomon error correction, Polynomial, Mathematics, Code (set theory), Lift (data mining), Cyclic code

Related papers

Back to paper searchBrowse research topicsOriginal source
Construction of BCH code over Z_p~k — Research Paper | ScholarLens