All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Some connections between BCK-algebras and n-ary block codes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60162694%3AG43__%2F18%3A00534289" target="_blank" >RIV/60162694:G43__/18:00534289 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/content/pdf/10.1007%2Fs00500-017-2788-z.pdf" target="_blank" >https://link.springer.com/content/pdf/10.1007%2Fs00500-017-2788-z.pdf</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/s00500-017-2788-z" target="_blank" >10.1007/s00500-017-2788-z</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Some connections between BCK-algebras and n-ary block codes

  • Original language description

    In general, when block codes are defined, the used alphabet is not binary. It is used an alphabet with n elements, n ≥ 2, identified usually with the set An = {0, 1, 2, . . . , n-1}. Recently, some papers were devoted to the study of the connections between binary block codes and BCK-algebras. These codes are called n-ary block codes. In this paper, we try to generalize these results to n-ary block codes, providing an algorithm which allows us to construct a BCK-algebra from a given n-ary block code. For this purpose, we will prove that to each n-ary block code V we can associate a BCK-algebra X, such that the n-ary block code generated by X, Vx, contains the code V as a subset and we will find in what circumstances the converse is also true.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10101 - Pure mathematics

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2018

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Soft Computing A Fusion of Foundations, Methodologies and Applications

  • ISSN

    1432-7643

  • e-ISSN

    1433-7479

  • Volume of the periodical

    22

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    DE - GERMANY

  • Number of pages

    6

  • Pages from-to

    41-46

  • UT code for WoS article

    000419355900004

  • EID of the result in the Scopus database

    2-s2.0-85028335139