Some improved encoding and decoding schemes for balanced codes

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 balanced codes. The first one, called improved single map, improves the computation complexity...

Full description

Saved in:
Bibliographic Details
Published in:2000 Pacific Rim International Symposium on Dependable Computing (PRDC 2000) pp. 103 - 109
Main Authors: Jong-Hoon Youn, Bose, B.
Format: Conference Proceeding
Language:English
Published: IEEE 2000
Subjects:
Binary codes
Block codes
Computer science
Decoding
Encoding
Fault tolerance
Fiber lasers
Laser transitions
Magnetic circuits
Very large scale integration
ISBN:9780769509754, 0769509754
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 balanced codes. The first one, called improved single map, improves the computation complexity of Knuth's single map function. 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.
ISBN:9780769509754
0769509754
DOI:10.1109/PRDC.2000.897291