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

Fingerprint

Testing
Graph

Keywords

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

ASJC Scopus subject areas

  • Management of Technology and Innovation

Cite this

Butorina, N. B., & Burkatovskaya, J. B. (2012). The properties of the essential subtrees of a graph representation of the (m, n) - Codewords. In Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012 [6357595] https://doi.org/10.1109/IFOST.2012.6357595

The properties of the essential subtrees of a graph representation of the (m, n) - Codewords. / Butorina, Natalia B.; Burkatovskaya, Julia B.

Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012. 2012. 6357595.

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

Butorina, NB & Burkatovskaya, JB 2012, The properties of the essential subtrees of a graph representation of the (m, n) - Codewords. in Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012., 6357595, 2012 7th International Forum on Strategic Technology, IFOST 2012, Tomsk, Russian Federation, 18.9.12. https://doi.org/10.1109/IFOST.2012.6357595
Butorina NB, Burkatovskaya JB. The properties of the essential subtrees of a graph representation of the (m, n) - Codewords. In Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012. 2012. 6357595 https://doi.org/10.1109/IFOST.2012.6357595
Butorina, Natalia B. ; Burkatovskaya, Julia B. / The properties of the essential subtrees of a graph representation of the (m, n) - Codewords. Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012. 2012.
@inproceedings{14ce1bd9c27c49b3b9b28b8ec898038b,
title = "The properties of the essential subtrees of a graph representation of the (m, n) - Codewords",
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.",
keywords = "(m, n), code, Self-checking circuit, self-testing checker",
author = "Butorina, {Natalia B.} and Burkatovskaya, {Julia B.}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/IFOST.2012.6357595",
language = "English",
isbn = "9781467317702",
booktitle = "Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012",

}

TY - GEN

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

AU - Butorina, Natalia B.

AU - Burkatovskaya, Julia B.

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

KW - (m, n)

KW - code

KW - Self-checking circuit

KW - self-testing checker

UR - http://www.scopus.com/inward/record.url?scp=84871842912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871842912&partnerID=8YFLogxK

U2 - 10.1109/IFOST.2012.6357595

DO - 10.1109/IFOST.2012.6357595

M3 - Conference contribution

SN - 9781467317702

BT - Proceedings - 2012 7th International Forum on Strategic Technology, IFOST 2012

ER -