DC FieldValueLanguage
dc.contributor.authorStanković, Radomiren
dc.contributor.authorAstola, Helenaen
dc.contributor.authorAstola, Jaakkoen
dc.date.accessioned2020-05-01T20:29:09Z-
dc.date.available2020-05-01T20:29:09Z-
dc.date.issued2014-01-01en
dc.identifier.issn1542-3980en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/2037-
dc.description.abstractThe Special Normal Form (SNF) for Boolean functions is a redundant representation that is useful in determining minimized Exclusive-Or-Sum-Of-Product (ESOP) expressions. Generalized Reed-Muller expressions (GRM) can be viewed as expressions that are close to the ESOPs in the number of products, however, they are easier to determine, which makes them important in practical applications. Galois field (GF) expressions are a generalization of Reed-Muller expressions to multiple-valued logic functions. This paper extends the notion of SNF for Boolean functions to ternary logic functions. An algorithm to minimize generalized Galois field (GF) expressions for ternary functions by using SNF is presented.en
dc.publisherOld City Publishing-
dc.relationSuomen Akatemia, Grant 213462-
dc.relation.ispartofJournal of Multiple-Valued Logic and Soft Computingen
dc.subjectGalois field expressions | Generalized Galois field expressions | Generalized Reed-Muller expressions | Reed-Muller expressions | Special normal formen
dc.titleDetermining minimized galois field expressions for ternary functions by using special normal formen
dc.typeArticleen
dc.identifier.scopus2-s2.0-84908703799en
dc.relation.firstpage53en
dc.relation.lastpage71en
dc.relation.issue1-4en
dc.relation.volume24en
dc.description.rankM21a-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.openairetypeArticle-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.fulltextNo Fulltext-
Show simple item record

SCOPUSTM   
Citations

1
checked on Jun 23, 2024

Page view(s)

35
checked on May 9, 2024

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.