Randomized Post-optimization for t-Restrictions

DOI10.1007/978-3-642-36899-8_30zbMath1309.05034OpenAlexW1886025061MaRDI QIDQ4915260

Peyman Nayeri, Charles J. Colbourn

Publication date: 9 April 2013

Published in: Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36899-8_30

zbMATH Keywords

frameproof codedisjunct matrixcovering arrayhash family

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Communication, information (94A99) Other types of codes (94B60) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items (2)

Sequence Covering Arrays and Linear Extensions ⋮ Detecting arrays for effects of single factors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit constructions of separating hash families from algebraic curves over finite fields
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Randomized post-optimization of covering arrays
• Strengthening hash families and compressive sensing
• Algorithmic construction of sets for k -restrictions
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Constructing Perfect Hash Families Using a Greedy Algorithm
• Randomized Postoptimization of Covering Arrays
• Threshold and Majority Group Testing
• Perfect Hash Families: Constructions and Existence

This page was built for publication: Randomized Post-optimization for t-Restrictions