Back to Results
First PageMeta Content
Mathematics / Pseudorandom number generators / Cryptography / Binary arithmetic / Linear feedback shift register / BCH code / Polynomial / Cyclic code / Berlekamp–Massey algorithm / Coding theory / Error detection and correction / Finite fields


Document Date: 2005-11-03 17:27:07

Open Document

File Size: 984,42 KB

Share Result on Facebook

City

Notre Dame / Cambridge / Watertown / St. Petersburg / San Remo / New York / /

Company

I. T. Press / Honeywell Corp. / Lg / BP / M. I. T. Research Laboratory / Bell Telephone Laboratories / Codex Corporation / McGraw-Hill / /

Country

Italy / /

Currency

USD / /

Event

FDA Phase / /

Facility

University of Notre Dame / Upon interchange / M. I. T. Research Laboratory of Electronics / Massachusetts Institute of Technology / Massachusetts Institute of Technolog Dame / /

IndustryTerm

recursive algorithm / digital device / iterative algorithm / minimal-length solution / shift-register synthesis algorithm / valid solution / interative algorithm / synthesis algorithm / recursive solution / /

Organization

Massachusetts Institute of Technolog / M. I. T / National Aeronautics and Space Administration / Massachusetts Institute of Technology / University of Notre Dame / /

Person

Grant NsG / G. D. Forney / Jr. / E. R. Berlekamp / JAMES L. MASSEY / Technolog Dame / /

/

Position

author / General / /

Product

lC-02536 / /

ProvinceOrState

Alabama / Indiana / Florida / Massachusetts / /

PublishedMedium

IEEE TRANSACTIONS ON INFORMATION THEORY / /

Technology

Berlekamp algorithm / synthesis algorithm / interative algorithm / iterative algorithm / shift-register synthesis algorithm / LFSR synthesis algorithm / recursive algorithm / /

SocialTag