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

Kód výsledku v 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>

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název periodika

Soft Computing A Fusion of Foundations, Methodologies and Applications

ISSN

1432-7643

e-ISSN

1433-7479

Svazek periodika

22

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

DE - Spolková republika Německo

Počet stran výsledku

6

Strana od-do

41-46

Kód UT WoS článku

000419355900004

EID výsledku v databázi Scopus

2-s2.0-85028335139