scientific article; zbMATH DE number 1759800

zbMath0995.94552MaRDI QIDQ4536823

Holger Schellwat, Juergen Bierbrauer

Publication date: 28 July 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Fourier transformReed-Solomon codesauthenticationhashingresiliencyHermitian codesWeil-Carlitz-Uchiyama boundZyablov boundalmost independent arraysexponential sum methodlow biasSuzuki codes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Binary Covering Arrays and Existentially Closed Graphs ⋮ Strengthening hash families and compressive sensing ⋮ Constructing heterogeneous hash families by puncturing linear transversal designs ⋮ Locating and detecting arrays for interaction faults ⋮ Structures and lower bounds for binary covering arrays ⋮ A quantum algorithm for testing and learning resiliency of a Boolean function ⋮ Constructions of almost secure frameproof codes with applications to fingerprinting schemes ⋮ Linear hash families and forbidden configurations ⋮ Covering arrays of higher strength from permutation vectors ⋮ Distributing hash families with few rows

This page was built for publication: