Reed-Muller-Fourier versus Galois field representations of four-valued logic functions

DC Field	Value	Language
dc.contributor.author	Stanković, Radomir	en
dc.contributor.author	Janković, Dragan	en
dc.contributor.author	Moraga, Claudio	en
dc.date.accessioned	2020-05-01T20:29:19Z	-
dc.date.available	2020-05-01T20:29:19Z	-
dc.date.issued	1998-01-01	en
dc.identifier.isbn	978-0-8186-8371-6	-
dc.identifier.issn	0195-623X	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/2149	-
dc.description.abstract	In this paper, we introduce Reed-Muller-Fourier representations of four-valued functions over the ring of integers modulo 4 and compare them with the Galois field representations over GF(4). It is reported that on the average Reed-Muller-Fourier representations exhibit a lower complexity than those based on Galois field polynomials.	en
dc.publisher	IEEE	-
dc.relation.ispartof	Proceedings of The International Symposium on Multiple-Valued Logic	en
dc.title	Reed-Muller-Fourier versus Galois field representations of four-valued logic functions	en
dc.type	Conference Paper	en
dc.relation.conference	28th IEEE International Symposium on Multiple-Valued Logic; Fukuoka, Jpn; 27 May 1998 through 29 May 1998	-
dc.identifier.doi	10.1109/ISMVL.1998.679340	-
dc.identifier.scopus	2-s2.0-0031640770	en
dc.relation.firstpage	186	en
dc.relation.lastpage	191	en
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.fulltext	No Fulltext	-
item.openairetype	Conference Paper	-

9

checked on Oct 17, 2024

12

checked on Oct 17, 2024

Check