The properties of the essential subtrees of a graph representation of the (m, n) - Codewords

Natalia B. Butorina, Julia B. Burkatovskaya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This The problem of synthesis of a self-testing checker for an arbitrary number l of (m, n) - codewords is considered. In particular, the problem of representation of number l by the sum of cardinal numbers of subsets of the codewords corresponding to essential subtrees of the tree representing all (m, n) - codewords is investigated. The properties of the essential subtrees are described.

Original languageEnglish
Title of host publicationProceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012
DOIs
Publication statusPublished - 1 Dec 2012
Event2012 7th International Forum on Strategic Technology, IFOST 2012 - Tomsk, Russian Federation
Duration: 18 Sep 201221 Sep 2012

Conference

Conference2012 7th International Forum on Strategic Technology, IFOST 2012
CountryRussian Federation
CityTomsk
Period18.9.1221.9.12

Keywords

  • (m, n)
  • code
  • Self-checking circuit
  • self-testing checker

ASJC Scopus subject areas

  • Management of Technology and Innovation

Fingerprint Dive into the research topics of 'The properties of the essential subtrees of a graph representation of the (m, n) - Codewords'. Together they form a unique fingerprint.

Cite this