Seventh Pacific Rim International Symposium on Dependable Computing (PRDC'00)
Some improved encoding and decoding schemes for balanced codes
Los Angeles, California
December 18-December 20
ISBN: 0-7695-0975-4
Jong-Hoon Youn, Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA
B. Bose, Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA
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.
Index Terms:
encoding; decoding; computational complexity; fault tolerant computing; encoding; decoding; balanced codes; binary code; computation complexity; Knuth's single map function; simulation results
Citation:
Jong-Hoon Youn, B. Bose, "Some improved encoding and decoding schemes for balanced codes," prdc, pp.103, Seventh Pacific Rim International Symposium on Dependable Computing (PRDC'00), 2000
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb