Best known PSLs for binary sequences from bit length 71 through 100

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Symposium on Telecommunications

• Publication date

  2008-10-14

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ISTEL.2008.4651390
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Introduction to Radar Systems

  2021cited by this paper
• The peak sidelobe distribution for binary codes

  2007cited by this paper
• Exhaustive search for long low autocorrelation binary codes using length-increment algorithm

  2007cited by this paper
• Bounds on the growth rate of the peak sidelobe level of binary sequences

  2007cited by this paper
• A new approach for long low autocorrelation binary sequence problem using genetic algorithm

  2006cited by this paper
• Near-optimal peak sidelobe binary codes

  2006cited by this paper
• Efficient exhaustive search for optimal-peak-sidelobe binary codes

  2005cited by this paper
• New results on minimum-PSL binary codes

  2001cited by this paper
• New binary sequences with good aperiodic autocorrelations obtained by evolutionary algorithm

  1999cited by this paper
• Exhaustive search for low-autocorrelation binary sequences

  1996cited by this paper
• Minimum peak sidelobe pulse compression codes

  1990cited by this paper
• A new search for skewsymmetric binary sequences with optimal merit factors

  1990cited by this paper
• Searching for Weakly Autocorrelated Binary Sequences

  1987cited by this paper
• Longest binary pulse compression codes with given peak sidelobe levels

  1986cited by this paper
• Binary sequences up to length 40 with best possible autocorrelation function

  1975cited by this paper

• A Survey on the Design of Binary Pulse Compression Codes with Low Autocorrelation

  2010cites this paper