Some connections between self-dual codes, combinatorial designs and secret sharing schemes

DOI10.3934/amc.2011.5.191zbMath1247.94045OpenAlexW2084862228MaRDI QIDQ2275872

Stefka Bouyuklieva, Zlatko G. Varbanov

Publication date: 10 August 2011

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2011.5.191

zbMATH Keywords

self-dual codescombinatorial designssecret-sharing schemes

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Related Items

Secret sharing schemes based on the dual of Golay codes ⋮ Construction and enumeration of self-orthogonal and self-dual codes over Galois rings of even characteristic ⋮ Nonexistence of certain singly even self-dual codes with minimal shadow ⋮ A recursive method for the construction and enumeration of self-orthogonal and self-dual codes over the quasi-Galois ring \(\mathbb{F}_{2^r}[u/<u^e>\)] ⋮ Hadamard Matrices, Designs and Their Secret-Sharing Schemes ⋮ Self-dual codes from 3-class association schemes