Bounds for sparse planar and volume arrays

DOI10.1109/18.904563MaRDI QIDQ4544498zbMATH OpenOpenAlexFDO

Authors Yann Meurisse, Jean-Pierre Delmas

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)

Recommendations

• An algorithm for near-optimal placement of sensor elements
• On the number of signals resolvable by a uniform linear array
• Bounds for the size of radar arrays
• Pattern diversity for narrowband direction finding with sensor arrays
• New bounds for the sizes of radar arrays

Cited in

(3)

• Volume computation for sparse Boolean quadric relaxations
• Planar additive bases for rectangles
• An algorithm for near-optimal placement of sensor elements

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4544498)