Invertible Binary Matrices

Abstract

In an alternative approach to digital network synthesis, M.G. Karpovsky (1976) presents an algorithm that minimizes the number of nonzero coefficients in a Haar expansion of a Boolean function. In this algorithm, an invertible modulo two matrix must be generated subject to certain constraints. Two algorithms are presented that can generate this matrix. A simple method of generating invertible modulo two matrices is also presented.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1980
Accession Number
ADA085575

Entities

People

  • Thomas C. Jedrey

Organizations

  • Harry Diamond Laboratories

Tags

Communities of Interest

  • Space
  • Weapons Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Central Processing Units
  • Coefficients
  • Computations
  • Computer Science
  • Computers
  • Consensus Algorithms
  • Demographic Cohorts
  • Engineering
  • Equations
  • Jet Propulsion
  • Linear Algebra
  • Mathematics
  • Naval Training
  • New York
  • Security
  • Walsh Functions

Readers

  • Computer Programming and Software Development.
  • Linear Algebra