Theory of Extended Linear Machines

Author

Paul, Kolin ; Choudhury, D. Roy ; Chaudhuri, P. Pal

Author_Institution

Dept. of Comput. Sci. & Technol., Bengal Eng. Coll., Howrah, India

Volume

51

Issue

9

fYear

2002

fDate

9/1/2002 12:00:00 AM

Firstpage

1106

Lastpage

1110

Abstract

This paper extends the theory of autonomous linear machines (LMs). The theory of the extension field has provided the foundation for the design of such machines referred to as Extended Linear Machines (ELM). An analytical framework has been reported to completely characterize the vector subspace generated by an ELM and also different variations of LMs having cyclic, as well as noncyclic vector subspaces. This formulation has resulted in a single algorithm that characterizes each of the vector subspaces in terms of cyclic and noncyclic subspaces. An ELM significantly reduces the computation time for characterizing the model and study of the behavior of the physical system compared to conventional binary linear machines.

Keywords

computational complexity; finite automata; polynomials; autonomous linear machines; binary linear machines; computation time; cyclic vector subspaces; extended linear machines; extension field; noncyclic vector subspaces; physical system; vector subspace; Bridges; Character generation; Cryptography; Error correction codes; Galois fields; Linear feedback shift registers; Physics computing; Testing; Vectors; Very large scale integration;

fLanguage

English

Journal_Title

Computers, IEEE Transactions on

Publisher

ieee

ISSN

0018-9340

Type

jour

DOI

10.1109/TC.2002.1032629

Filename

1032629