On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$

DOI10.1137/120881129zbMath1319.11043OpenAlexW2047549572MaRDI QIDQ5251659

Nader H. Bshouty, Hanna Mazzawi

Publication date: 20 May 2015

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120881129

zbMATH Keywords

parity-check matrixcoin weighing problemreconstructing graph from additive queriessignature coding problem

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial structures in finite projective spaces (51E20) Combinatorial codes (94B25) Signed and weighted graphs (05C22) Relations with coding theory (11H71)

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
• Search problems on graphs
• Determining defectives in a linear order
• Reconstructing a Hamiltonian cycle by querying the graph: Application to DNA physical mapping
• Learning and Verifying Graphs Using Queries with a Focus on Edge Counting
• On the singularity of random matrices with independent entries
• Reconstructing Weighted Graphs with Minimal Query Complexity
• A fast and simple randomized parallel algorithm for the maximal independent set problem
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• On a Combinatorial Problem in Number Theory
• On Möbius Functions and a Problem in Combinatorial Number Theory
• On a lemma of Littlewood and Offord
• Graph-Theoretic Concepts in Computer Science
• Optimal reconstruction of graphs under the additive model

This page was built for publication: On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$