On efficient balanced codes

ABSTRACT

Balanced codes have the property that no codeword is “contained” in another. This property makes balanced codes attractive for certain applications, such as the encoding of unchangeable data on a laser disk. Donald E. Knuth [1] described a balanced code with 2p information bits and p parity bits, for which serial encoding and decoding is especially efficient. In order to encode and decode efficiently, he constructed a suitable mapping for p = 8. The purpose of this paper is to construct a similar mapping for every p.

REFERENCES

• 1: D E Knuth, Efficient balanced codes, IEEE Transactions on Information Theory, v.32 n.1, p.51-53, Jan. 1986 [doi>10.1109/TIT.1986.1057136]
• 2: E.L.Leiss,Data integrity .in digital optical disks, IEEE Transaction on Computer,vol. C-33(1984) 818-827.

INDEX TERMS

Primary Classification:
  E. Data
  E.4 CODING AND INFORMATION THEORY
      Subjects: Data compaction and compression

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS

General Terms:
Design, Performance, Reliability, Theory