✦ LIBER ✦

A Computer Algorithm for Minimizing Reed-Muller Canonical Forms

✍ Scribed by Fleisher, H.; Tavel, M.; Yeager, J.

Book ID: 114607039
Publisher: IEEE
Year: 1987
Tongue: English
Weight: 824 KB
Volume: C-36
Category: Article
ISSN: 0018-9340
DOI: 10.1109/tc.1987.1676890

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Note on Minimal Reed-Muller Canonical

A Note on Minimal Reed-Muller Canonical Forms of Switching Functions

✍ Kodandapani, K.L.; Setlur, R.V. 📂 Article 📅 1977 🏛 IEEE 🌐 English ⚖ 870 KB

A simple algorithm for computing canonic

A simple algorithm for computing canonical forms

✍ H. Ford; L.R. Hunt; Renjeng Su 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 904 KB

A root-finding algorithm for list decodi

A root-finding algorithm for list decoding of Reed-Muller codes

✍ Wu, X.-W.; Kuijper, M.; Udaya, P. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 290 KB

Baldwinian learning utilizing genetic an

Baldwinian learning utilizing genetic and heuristic algorithms for logic synthesis and minimization of incompletely specified data with Generalized Reed–Muller (AND–EXOR) forms

✍ Karen M Dill; Marek A Perkowski 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 126 KB

A New Algorithm for the Computation of C

A New Algorithm for the Computation of Canonical Forms of Matrices over Fields

✍ ALLAN STEEL 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A new algorithm is presented for the computation of canonical forms of matrices over fields. These are the Primary Rational, Rational, and Jordan canonical forms. The algorithm works by obtaining a decomposition of the vector space acted on by the given matrix into primary cyclic spaces (spaces whos

Performance of Reed-Muller codes and a m

Performance of Reed-Muller codes and a maximum-likelihood decoding algorithm for OFDM

✍ Jones, A.E.; Wilkinson, T.A. 📂 Article 📅 1999 🏛 IEEE 🌐 English ⚖ 109 KB