SOME CONNECTIONS BETWEEN SELF-DUAL CODES, COMBINATORIAL DESIGNS AND SECRET-SHARING SCHEMES


Върбанов, Златко (2011) SOME CONNECTIONS BETWEEN SELF-DUAL CODES, COMBINATORIAL DESIGNS AND SECRET-SHARING SCHEMES Advances in Mathematics of Communications, vol.5, N:2, 2011, pp.191-198, [ISSN 1930-5338, 1930-5346], https://www.scopus.com/record/display.uri?eid=2-s2.0-79955780715&origin=resultslist&sort=plf-f&src=s&sid=a5ab8b39e997560908779cab035929a0&sot=autdocs&sdt=autdocs&sl=18&s=AU-ID%2856618122100%29&relpos=1&citeCnt=3&searchTerm=


 We study a class of singly-even self-dual codes with the special property that the minimum weight of their shadow is 1. Some of these codes support 1 and 2-designs. Using them, we describe two types of schemes based on codes, the first is an one-part secret sharing scheme and the second is a two-part sharing scheme. Similar schemes can be constructed from self-dual codes that support 3-designs.
  Статия
 self-dual codes, secret-sharing schemes, combinatorial designs


Природни науки, математика и информатика

Natural sciences, mathematics and informatics

 Издадено
  22212
 Златко Върбанов

4. St. Bouyuklieva, M. Harada, A. Munemasa, "Nonexistence of certain singly even self-dual codes with minimal shadow", The electronic journal of combinatorics 25(1), July 2017

3. Bilal, M., Borges, J., Dougherty, S.T., "Self-dual codes from 3-class association schemes", Applicable Algebra in Engineering Communication and Computing, Volume 26, Issue 3, June 2015, pp. 227–250

2. St.Bouyuklieva, W.Willems, "Singly Even Self-Dual Codes With Minimal Shadow", IEEE Transactions on Information Theory 58(6), 2012

1. Ch.Koukouvinos, D.Simos, Zl.Varbanov, "Hadamard Matrices, Designs and Their Secret-Sharing Schemes", LNCS 6742, Springer, 2011, pp.216-229

Научният архив поддържа инициативата за отворен достъп OAI 2.0 с начален адрес: http://da.uni-vt.bg/oai2/