Skip to main content
Kent State University Home

Open Access Kent State (OAKS)

  • About
    • About
    • Frequently Asked Questions
    • Rights and Reuse
  • Browse
    • Authors
    • Collections
    • Communities
    • Subjects
  • Login

Error Correction in Finite Arbitrary Length Binary Messages

  1. Open Access Kent State
  2. Conferences & Events
  3. Undergraduate Research Symposium
  4. 2016 - Kent State University Undergraduate Symposium on Research, Scholarship and Creative Activity
  5. Kent State University Undergraduate Symposium on Research, Scholarship and Creative Activity
  6. Error Correction in Finite Arbitrary Length Binary Messages
Author(s)
  • Donald W Fincher
Abstract

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.

Format
Conference Proceeding
Publication Date
2016-03-15
Contributor(s)
Faculty Mentor
Dr. Donald White
Subject
  • Algebra
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology
  • Other Applied Mathematics
Modified Abstract

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.

  • Facebook
  • Linkedin
  • Twitter
  • Pinterest
  • Email
Open Access Kent State
University Libraries

Street Address

1125 Risman Dr.
Kent, OH 44242

Mailing Address

P.O. Box 5190
Kent, OH 44242-0001

Contact Us

  • oaks [at] kent [dot] edu

Quick Links

  • About
  • Frequently Asked Questions
  • Rights and Reuse

Information

  • Accessibility
  • Annual Security Reports
  • Emergency Information
  • For Our Alumni
  • For the Media
  • Health Services
  • Jobs & Employment
  • May 4th, 50th Commemoration
  • Privacy Statement
  • Website Feedback
Kent State University Home
© 2021 Kent State University All rights reserved.