PARITY DEFINITION BY OPERATIONS MODULO SOME 2**i-1 AND ITS POSSIBLE APPLICATIONS IN EVALUATING THE COMPLEXITY OF A LOG OPERATION OVER GF (2**n).

Benjamin Arazi

PARITY DEFINITION BY OPERATIONS MODULO SOME 2i-1 AND ITS POSSIBLE APPLICATIONS IN EVALUATING THE COMPLEXITY OF A LOG OPERATION OVER GF (2n).

Department of Electrical & Computer Engineering

Research output: Contribution to journal › Conference article › peer-review

Original language	English
Pages (from-to)	520-527
Number of pages	8
Journal	Proceedings - Annual Allerton Conference on Communication, Control, and Computing
State	Published - 1 Dec 1983

ASJC Scopus subject areas

General Engineering

Cite this

@article{7c398aad80324f87bbe9451d2321b02e,

title = "PARITY DEFINITION BY OPERATIONS MODULO SOME 2**i-1 AND ITS POSSIBLE APPLICATIONS IN EVALUATING THE COMPLEXITY OF A LOG OPERATION OVER GF (2**n).",

author = "Benjamin Arazi",

year = "1983",

month = dec,

day = "1",

language = "English",

pages = "520--527",

journal = "Proceedings - Annual Allerton Conference on Communication, Control, and Computing",

issn = "0732-6181",

}

TY - JOUR

T1 - PARITY DEFINITION BY OPERATIONS MODULO SOME 2**i-1 AND ITS POSSIBLE APPLICATIONS IN EVALUATING THE COMPLEXITY OF A LOG OPERATION OVER GF (2**n).

AU - Arazi, Benjamin

PY - 1983/12/1

Y1 - 1983/12/1

UR - http://www.scopus.com/inward/record.url?scp=0021004624&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0021004624

SN - 0732-6181

SP - 520

EP - 527

JO - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

JF - Proceedings - Annual Allerton Conference on Communication, Control, and Computing

ER -

PARITY DEFINITION BY OPERATIONS MODULO SOME 2**i-1 AND ITS POSSIBLE APPLICATIONS IN EVALUATING THE COMPLEXITY OF A LOG OPERATION OVER GF (2**n).

ASJC Scopus subject areas

Other files and links

Cite this

PARITY DEFINITION BY OPERATIONS MODULO SOME 2i-1 AND ITS POSSIBLE APPLICATIONS IN EVALUATING THE COMPLEXITY OF A LOG OPERATION OVER GF (2n).