On balanced codes

Author

Al-Bassam, Sulaiman ; Bose, Rella

Author_Institution

Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA

Volume

Issue

fYear

1990

fDate

3/1/1990 12:00:00 AM

Firstpage

406

Lastpage

408

Abstract

In a balanced code each codeword contains equally many 1´s and 0´s. Parallel decoding balanced codes with 2^r (or 2^r-1) information bits are presented, where r is the number of check bits. The 2²-r-1 construction given by D.E. Knuth (ibid., vol.32, no.1, p.51-3, 1986) is improved. The new codes are shown to be optimal when Knuth´s complementation method is used

Keywords

decoding; error detection codes; balanced codes; codeword; complementation method; error detection codes; optimal codes; parallel decoding; Binary codes; Decoding; Fault detection; Fault tolerance; Information theory; Optical design; Optical fibers; Sequential circuits;

fLanguage

English

Journal_Title

Information Theory, IEEE Transactions on

Publisher

ieee

ISSN

0018-9448

Type

jour

DOI

10.1109/18.52490

Filename

52490

Link To Document

https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1419878