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 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.
| Original language | English (US) |
|---|---|
| Title of host publication | Proceedings of IEEE Pacific Rim International Symposium on Dependable Computing, PRDC |
| Pages | 103-109 |
| Number of pages | 7 |
| ISBN (Electronic) | 0769509754 |
| DOIs | |
| State | Published - 2000 |
| Externally published | Yes |
Keywords
- Binary codes
- Block codes
- Computer science
- Decoding
- Encoding
- Fault tolerance
- Fiber lasers
- Laser transitions
- Magnetic circuits
- Very large scale integration
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Computer Science Applications
- Hardware and Architecture
- Software