New bounds for the sizes of radar arrays

DOI10.1109/18.333892MaRDI QIDQ4324152zbMATH OpenOpenAlexFDO

Authors Zhen Zhang, Chungming Tu

Publication date 1 March 1995

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

Full work available at URL https://doi.org/10.1109/18.333892

zbMATH Keywords

autocorrelation functiondifference setslower boundpermutation matricesradar arrayupper bounds

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Designs and configurations (05B99)

Recommendations

• Bounds for the size of radar arrays
• Improved bounds on maximum size binary radar arrays
• scientific article; zbMATH DE number 67083
• A Systematic Construction for Radar Arrays
• Golomb rectangles

Cited in

(10)

• Applications of additive sequence of permutations
• Geometric orthogonal codes and geometrical difference packings
• Perfect difference families, perfect difference matrices, and related combinatorial structures
• A Systematic Construction for Radar Arrays
• Golomb rectangles
• Bounds for the size of radar arrays
• Improved bounds on maximum size binary radar arrays
• Bounds for sparse planar and volume arrays
• Golay-Rudin-Shapiro polynomials and phased arrays
• The existence of perfect (n m, 3, 2, 1)-geometric orthogonal codes

This page was built for publication: New bounds for the sizes of radar arrays

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