Bounds for sparse planar and volume arrays

DOI10.1109/18.904563zbMath1001.94505OpenAlexW2134802703MaRDI QIDQ4544498

Jean-Pierre Delmas, Yann Meurisse

Publication date: 4 August 2002

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9b5f58f62dfca9432ee1b26a30af15af4b3be741

zbMATH Keywords

difference baseminimum hole arrayminimum redundancy arraysparse planar arrayssparse volume array

Mathematics Subject Classification ID

Detection theory in information and communication theory (94A13)

This page was built for publication: Bounds for sparse planar and volume arrays