scientific article; zbMATH DE number 3248638
From MaRDI portal
Publication:5535504
zbMATH Open0154.44005MaRDI QIDQ5535504FDOQ5535504
Authors: Bernt Lindström 
Publication date: 1964
Title of this publication is not available (Why is that?)
Cited In (20)
- Coding for the Multiple-Access Adder Channel
- Optimal schemes for combinatorial query problems with integer feedback
- On error correction with errors in both the channel and syndrome
- Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
- Title not available (Why is that?)
- On metric dimension of nonbinary Hamming spaces
- Random and quasi-random designs in group testing
- New combinatorial designs and their applications to group testing
- Exact learning from an honest teacher that answers membership queries
- On the metric dimension of the folded \(n\)-cube
- Computing minimal doubly resolving sets of graphs
- On the metric dimension of Cartesian powers of a graph
- Computation of the double metric dimension in convex polytopes
- Resolving the hypercube
- Symmetry properties of resolving sets and metric bases in hypercubes
- A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem
- On the strong metric dimension of tetrahedral diamond lattice
- Search problems: One, two or many rounds
- Optimal Detection of Two Complementary Defectives
- Signature codes for noisy multiple access adder channel
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)
