Optimizing the aperiodic merit factor of binary arrays

DOI10.1016/0165-1684(93)90047-EzbMATH Open0769.93022OpenAlexW2087996785MaRDI QIDQ1803397FDOQ1803397

Leopold Bömer, Markus Antweiler

Publication date: 29 June 1993

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(93)90047-e

zbMATH Keywords

merit factorperfect arraysCalabro-Wolf arraysdifference set arraysLegendre arraysLempel arraysminimal sidelobesproduct arraysshift-register arrays

Mathematics Subject Classification ID

System identification (93B30)

Cited In (2)

• Efficient Optimization of the Merit Factor of Long Binary Sequences
• Families of 3D Arrays for Video Watermarking

   Recommendations

• Efficient Optimization of the Merit Factor of Long Binary Sequences 👍 👎
• Advances in the merit factor problem for binary sequences 👍 👎
• The merit factor of binary arrays derived from the quadratic character 👍 👎
• A Survey of the Merit Factor Problem for Binary Sequences 👍 👎
• Title not available (Why is that?) 👍 👎
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes 👍 👎
• On perfect binary arrays 👍 👎
• Further improvement on dynamic programming for optimal bit allocation 👍 👎
• Optimal Interleaving Schemes for Two-Dimensional Arrays 👍 👎

This page was built for publication: Optimizing the aperiodic merit factor of binary arrays

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