1995•IEEE Transactions on Information TheoryRequires access

Constructing a better cyclic code than cyclic Reed-Solomon code

Czesław Kościelny

Abstract

Problems of computing the generator polynomial for a (q+1, q-d+2) reversible cyclic BCH code over GF(q), q=p/sup m/, having the minimum Hamming distance d, are presented. The considered code is almost as short as a Reed-Solomon (RS) code but it generates codewords with two information symbols more than the codewords of RS code with the same minimum Hamming distance.>

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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

Key concepts: Cyclic code, Polynomial code, BCH code, Reed–Solomon error correction, Hamming code, Code (set theory), Hamming distance, Hamming bound