### Construction of Merit Factors of Jacobi Sequence through Periodic Extension and a Directed Search Methods

#### Abstract

#### Keywords

#### Full Text:

PDF#### References

R. A. Kristiansen, “On the Aperiodic Autocorrelation of Binary Sequences, ”Master’s thesis, Selmer Centre ,University of Bergen ,Norway, 2003. Available: [Online] at http://www.ii.uib.no/~matthew/Masters/notes.ps.

P. Borwein, K.-K. S. Choi, and J. Jedwab, “Binary sequences with merit factor greater than 6.34,” IEEE Trans. Inform. Theory, vol. 50, pp. 3234–3249, Dec. 2004.

M. J. E. Golay, “A class of ﬁnite binary sequences with alternate autocorrelation values equal to zero,” IEEE Trans. Inform. Theory, vol.I18, pp. 449–450, May 1972.

“Sieves for low autocorrelation binary sequences,” IEEE Trans. Inform. Theory, vol. IT-23, pp. 43–51, Jan. 1977.

T. Høholdt et al., “The merit factor of binary sequences,” in Difference Sets, Sequences and their Correlation Properties. ser. C,A. Pottet al.,Eds. Norwell, MA Kluwer, 1999, vol. 542, Mathematical and Physical Sciences, pp. 227–237.

J. Storer and R. J. Turyn, “On binary sequences,” in Proc. Amer. Math Soc., vol. 12, 1961, pp. 394–399.

M. J. E. Golay, “The merit factor of long low autocorrelation binary sequences, ”IEEE Trans. Inform. Theory, vol. IT-28, pp.543–549,May 1982.

J. Lindner, “Binary sequences up to length 40 with best possible autocorrelation function,” Electron. Lett ., vol. 2, p. 507, 1975.

S. Mertens, “Exhaustive search for low-autocorrelation binary sequences,” J. Phys.A, vol. 29, pp. L473–L481, 1996.

(2002)TheBernasconiModel.[Online].Available: http://odysseus.nat.uni- magdeburg.de/~mertens/bernasconi/

M. J. E. Golay, “A new search for skew symmetric binary sequence with optimal merit factors, ” IEEE Trans. Inform. Theory, vol. 36, pp.1163–1166, Sept. 1990.

B. Militzer, M. Z amparelli, and D. Beule, “Evolutionary search for low autocorrelated binary sequence, ” IEEE Trans. Evol. Comput., vol. 2, pp.34–39, Apr. 1998.

M. J. E. Golay, “The merit factor of Legendre sequences,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 934–936, Nov. 1983.

J. Jensen, H. Jensen, and T. Høholdt, “The merit factor of binary sequences related to difference sets,” IEEE Trans. Inform. Theory, vol. 37, pp. 617–626, Jan. 1991.

M. G. Parker, “Even length binary sequence families with low nega periodic autocorrelation,” in Proc. AAECC-14, Melbourne, Australia (Lecture Notes in Computer Science). Berlin, Germany: Springer Verlag, Nov. 26–30, 2001, vol. 2227, pp. 200–210.

T. Høholdt and H. Jensen, “Determination of the merit factor of Legendre sequences, ” IEEE Trans. Inform. Theory, vol. 34, pp. 161–164,Jan. 1988.

A. Kirilusha and G. Narayanaswamy. (1999) Construction of new asymptotic classes of binary sequences based on existing asymptotic classes. Univ. of Richmond, Dept. Math.and Compute.Sci.Tech.Rep. [Online].

Raymond A. Kristiansen and Matthew G. Parker , Member, IEEE ”Binary Sequences With Merit Factor >6.3” IEEE Transactions on Information Theory.vol.50. no. 12 dec 2004

Zongduo dai, Guang Gong, Yoong-Yeop Song “Trace representation of Binary Jacobi Sequence”2003 IEEE ISIT June 29-July 4,2003

J.M. banden ”Efficient Optimization of the Merit Factor of Long Binary Sequences” Senior member, IEEE, nov-12, 2011.

### Refbacks

- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution 3.0 License.