Determination of sparse representations of multiple-valued logic functions by using covering codes

zbMATH Open1395.94390MaRDI QIDQ4583695FDOQ4583695

Authors: Radomir S. Stanković, Jaakko Astola 

Publication date: 3 September 2018

Full work available at URL: http://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-19-number-4-2012/mvlsc-19-4-p-285-306/

Recommendations

• scientific article; zbMATH DE number 2107115
• Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions
• An Algebraic Method for Designing Multivalued Logic Circuits using Principally Binary Components
• Codings and their application in the DNF-implementation of binary functions
• Publication:3035136

zbMATH Keywords

coding theorysparse representationslogic design

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (1)

• Upper bounds on the length function for covering codes with covering radius \(R\) and codimension \(tR+1\)

This page was built for publication: Determination of sparse representations of multiple-valued logic functions by using covering codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4583695)