GENERAL THEORY OF MOST EFFICIENT CODES.
Abstract
In this paper, the number of most efficient binary codes and the construction methods are discussed in general, where the most efficient binary codes mean codes with a minimum Hamming distance of p. The purpose of the paper was to obtain maximum m and the value of each x sub ij. Discussed are: (1) A theorem which plays an important role in the coding problem; (2) The matrix H(n, p); (3) The characteristic values of H(n, p); (4) Some properties of the independence of vectors; (5) A solution under some conditions (group code condition implies these conditions; accordingly, group code is a special case of these conditions); (6) One method of general solution; and (7) Application of Boolean algebra in finding a general solution.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 09, 1964
- Accession Number
- AD0602096
Entities
People
- Yasuo Komamiya
Organizations
- University of Illinois Urbana–Champaign