On proper secrets, \((t,k)\)-bases and linear codes

DOI10.1007/s10623-009-9272-4zbMath1185.94089OpenAlexW2000304127MaRDI QIDQ735016

Tamir Tassa, Jorge Luis Villar

Publication date: 14 October 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-009-9272-4

zbMATH Keywords

linear codesthreshold secret sharingbasesprojective geometrylinear independencespanning set

Mathematics Subject Classification ID

Circuits, networks (94C99) Authentication, digital signatures and secret sharing (94A62) Vector spaces, linear dependence, rank, lineability (15A03) Convolutional codes (94B10)

Related Items (2)

Mutually orthogonal frequency rectangles ⋮ Authenticated garbling from simple correlations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Curve razionali normali e \(k\)-archi negli spazi finiti
• Correction note otto 'On maximal (k,t)-sets'
• The packing problem in statistics, coding theory and finite projective spaces
• Polynomial interpolation to data on flats in \(\mathbb{R}^d\)
• The number of linearly independent binary vectors with applications to the construction of hypercubes and orthogonal arrays, pseudo \((t,m,s)\)-nets and linear codes
• The cardinality of sets of \(k\)-independent vectors over finite fields
• A vector-space packing problem
• Oblivious evaluation of multivariate polynomials
• How to share a secret
• Polynomial Time Algorithms for Multicast Network Code Construction
• Network information flow
• Maximum distance<tex>q</tex>-nary codes
• A Theorem in Finite Projective Geometry and an Application to Statistics
• Orthogonal Arrays of Index Unity

This page was built for publication: On proper secrets, \((t,k)\)-bases and linear codes