Boolean functions with multiplicative complexity 3 and 4

Multiplicative complexity (MC) is defined as the minimum number of AND gates required to implement a function with a circuit over the basis (AND, XOR, NOT). Boolean functions with MC 1 and 2 have been characterized in Fisher and Peralta ( 2002 ), and Find et al. (IJICoT 4 (4), 222–236, 2017 ), respe...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Cryptography and communications Ročník 12; číslo 5; s. 935 - 946
Hlavní autori:	Çalık, Çağdaş, Turan, Meltem Sönmez, Peralta, René
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2020 Springer Nature B.V
Predmet:	Affine transformations Boolean Boolean algebra Boolean functions Circuits Codes Coding and Information Theory Communications Engineering Complexity Computer Science Data Structures and Information Theory Equivalence Gates (circuits) Information and Communication Linearity Lower bounds Mathematics of Computing Networks 06E30 Boolean functions 94A60 Affine equivalence Multiplicative complexity
ISSN:	1936-2447, 1936-2455
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!