UR Scholarship Repository

Title

An Examination of Codewords with Optimal Merit Factor

Authors

Michael W. Cammarano
Anthony G. Kirilusha

Document Type

Technical Report

Publication Date

4-9-1999

Abstract

We examine the codewords with best possible merit factor (minimum sum of squares of periodic autocorrelations) for a variety of lengths. Many different approaches were tried in an attempt to find construction methods for such codewords, or for codewords with good but non-optimal merit factors.

Comments

Copyright © 1999, Michael W. Cammarano and Anthony G. Kirilusha, University of Richmond, Richmond, Virginia.

Please note that downloads of the technical report are for private/personal use only.

Recommended Citation

Michael W. Cammarano and Anthony G. Kirilusha. An Examination of Codewords with Optimal Merit Factor. Technical paper (TR-99-02). Math and Computer Science Technical Report Series. Richmond, Virginia: Department of Mathematics and Computer Science, University of Richmond, April, 1999.