scientific article; zbMATH DE number 3248638
From MaRDI portal
Publication:5535504
Cited in
(20)- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
- Random and quasi-random designs in group testing
- Exact learning from an honest teacher that answers membership queries
- On the strong metric dimension of tetrahedral diamond lattice
- Computation of the double metric dimension in convex polytopes
- Computing minimal doubly resolving sets of graphs
- On metric dimension of nonbinary Hamming spaces
- Search problems: One, two or many rounds
- Resolving the hypercube
- Symmetry properties of resolving sets and metric bases in hypercubes
- Optimal schemes for combinatorial query problems with integer feedback
- On the metric dimension of the folded \(n\)-cube
- scientific article; zbMATH DE number 7589564 (Why is no real title available?)
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- Coding for the Multiple-Access Adder Channel
- New combinatorial designs and their applications to group testing
- On error correction with errors in both the channel and syndrome
- On the metric dimension of Cartesian powers of a graph
- Signature codes for noisy multiple access adder channel
- Optimal Detection of Two Complementary Defectives
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5535504)
