Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications

DOI10.1007/978-3-642-22006-7_47zbMath1334.68298MaRDI QIDQ3012832

Atri Rudra, Ely Porat, Hung Quang Ngo

Publication date: 6 July 2011

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22006-7_47

Mathematics Subject Classification ID

68R05: Combinatorics in computer science

68P30: Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science)

68W20: Randomized algorithms

Related Items

Subquadratic non-adaptive threshold group testing, Non-adaptive complex group testing with multiple positive sets, A new strongly competitive group testing algorithm with small sequentiality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Families of finite sets in which no set is covered by the union of \(r\) others
• On the upper bound of the size of the \(r\)-cover-free families
• On \(r\)-cover-free families
• Noise-Resilient Group Testing: Limitations and Constructions
• Explicit Non-adaptive Combinatorial Group Testing Schemes
• Tracing Many Users With Almost No Rate Penalty
• Data Stream Algorithms for Codeword Testing
• Indexing Information for Data Forensics
• Data Stream Algorithms via Expander Graphs
• Optimal Monotone Encodings
• Optimal Two-Stage Algorithms for Group Testing Problems