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


 In this work 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.
  Статия
 Coding theory, Cryptography


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

Natural sciences, mathematics and informatics
Natural sciences, mathematics and informatics Mathematics

 Издадено
  5508
 Стефка Буюклиева

1.  M. Bilal, J. Borges, S. T. Dougherty, C. Fernández-Córdoba, Self-dual codes from 3-class association schemes, Applicable Algebra in Engineering, Communication and Computing, vol. 26, pp. 227-250, June 2015.

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