# Accession Number:

## AD0602096

# Title:

## GENERAL THEORY OF MOST EFFICIENT CODES.

# Descriptive Note:

# Corporate Author:

## ILLINOIS UNIV URBANA DIGITAL COMPUTER LAB

# Personal Author(s):

# Report Date:

## 1964-06-09

# Pagination or Media Count:

## 109.0

# 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 Hn, p 3 The characteristic values of Hn, 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.