Graduate Project

 

Some Improved Encoding and Decoding Schemes for Balanced Codes Public Deposited

Downloadable Content

Download PDF
https://ir.library.oregonstate.edu/concern/graduate_projects/vh53wv79n

Descriptions

Attribute NameValues
Creator
Abstract
  • A binary code of length n is called a balanced code if each codeword contains exactly ⌊n/2⌋ (or ⌈n/2⌉) ones and ⌈n/2⌉ (or ⌊n/2⌋) zeros. In this paper, we give two improved methods for encoding and decoding the balanced codes. The first one, called improved single map, improves the computation complexity of the complementation methods, first proposed by Knuth. This method, instead of complementing one bit at a time as done in Knuth's method, complements several appropriate bits at a time. Some simulation results show the improvement of this scheme over the previously known methods. The second one is a parallel implementation of this method.
Contributor
Resource Type
Date Available
Date Issued
Degree Level
Degree Name
Degree Field
Degree Grantor
Commencement Year
Academic Affiliation
Subject
Rights Statement
Funding Statement (additional comments about funding)
  • This work is supported by the U.S. National Science Foundation grant under MIP-9705738
Publisher
Peer Reviewed
Language
Replaces
Additional Information
  • description.provenance : Made available in DSpace on 2012-08-03T15:04:47Z (GMT). No. of bitstreams: 1someimprovedencoding.pdf: 111700 bytes, checksum: b51f51c89bb69f64e2ec6fe95bbc078e (MD5) Previous issue date: 2001-08-13
  • description.provenance : Approved for entry into archive by Laura Wilson(laura.wilson@oregonstate.edu) on 2012-08-03T15:04:47Z (GMT) No. of bitstreams: 1someimprovedencoding.pdf: 111700 bytes, checksum: b51f51c89bb69f64e2ec6fe95bbc078e (MD5)
  • description.provenance : Submitted by Laura Wilson (laura.wilson@oregonstate.edu) on 2012-08-03T15:03:12ZNo. of bitstreams: 1someimprovedencoding.pdf: 111700 bytes, checksum: b51f51c89bb69f64e2ec6fe95bbc078e (MD5)

Relationships

Parents:

This work has no parents.

Items