In this work, we shall investigate error correction in binary messages of finite arbitrary length in order to find the densest packing of codewords, i.e., the most efficient set of codewords. This is an important area of research because of the increasing reliance on digital communications, which are based on binary messages. We build on the work of Richard Hamming who contributed the Hamming distance, which is a method for measuring the difference between two segments, i.e., words, of a message. Our results suggest that for a message of length n, where n is at least 4, there are 2^(n-3) single-error correctable codewords out of 2^n possible words. These results will allow us to make further strides toward finding efficient multiple-error correctable codes in the future.
« Previous | 1 - 2 of 2 | Next »