Search Strategy of Large Nonlinear Block Codes

Simple item page
dc.contributor.authorNovák Ondřejcs
dc.date.accessioned2022-01-29T19:04:32Z
dc.date.available11-22-2022en
dc.date.available2022-01-29T19:04:32Z
dc.date.issued2021cs
dc.format.extent8cs
dc.identifier.doi10.1109/DSD53832.2021.00085
dc.identifier.isbn978-1-6654-2703-6cs
dc.identifier.urihttps://dspace.tul.cz/handle/15240/162300
dc.language.isoengcs
dc.publisherIEEEcs
dc.relation.ispartof2021 24th Euromicro Conference on Digital System Design (DSD)en
dc.relation.ispartofseries1cs
dc.relation.urihttps://ieeexplore.ieee.org/document/9556478cs
dc.subjectBISTcs
dc.subjectDesign for Testabilitycs
dc.subjectDigital Systemscs
dc.subjectTest vector compression techniquecs
dc.subjectBinary nonlinear codescs
dc.subjectgraph theorycs
dc.subjectMinimum Clique cover problemcs
dc.titleSearch Strategy of Large Nonlinear Block Codesen
dc.titleSearch Strategy of Large Nonlinear Block Codescs
local.citation.epage527-534cs
local.citation.spage527-534cs
local.event.locationPalermo, Italyen
local.identifier.publikace8997
Files
Collections