ScholarLens Back to search
1992•Unpublished venueRequires access

BCH codes as subcodes of Hamming codes

Oliver Pretzel

Open publisher page 0 citations

Abstract

Abstract How do you modify a Hamming code to correct two errors? In other words, how can you increase its minimum distance from 3 to 5? You will either have to lengthen the code words or eliminate some of them from your code. Correcting two errors in a long word may not be much better than correcting one error in a short one. So we adopt the second approach. That is, we shall try to produce a double error-correcting subcode of the Hamming code by removing some code words to make the new code sparser.

About this research paper

What this paper is about

Abstract How do you modify a Hamming code to correct two errors? In other words, how can you increase its minimum distance from 3 to 5? You will either have to lengthen the code words or eliminate some of them from your code. Correcting two errors in a long word may not be much better than correcting one error in a short one. So we adopt the second approach. That is, we shall try to produce a double error-correcting subcode of the Hamming code by removing some code words to make the new code sparser.

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

Abstract How do you modify a Hamming code to correct two errors? In other words, how can you increase its minimum distance from 3 to 5? You will either have to lengthen the code words or eliminate some of them from your code. Correcting two errors in a long word may not be much better than correcting one error in a short one. So we adopt the second approach. That is, we shall try to produce a double error-correcting subcode of the Hamming code by removing some code words to make the new code sparser.

Key concepts: Hamming code, Constant-weight code, Hamming bound, Hamming(7,4), Cyclic code, BCH code, Code (set theory), Computer science

Related papers

Related paper 1Related paper 2
Back to paper searchBrowse research topicsOriginal source
BCH codes as subcodes of Hamming codes — Research Paper | ScholarLens