2020
DOI: 10.48550/arxiv.2010.02829
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Three new lengths for cyclic Legendre pairs

Abstract: There are 20 odd integers v less than 200 for which the existence of Legendre pairs of length v is undecided. The smallest among them is v = 77. We have constructed Legendre pairs of lengths 91, 93 and 123 reducing the number of undecided cases to 17.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2021
2021
2021
2021

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…. , n}, each vector generated through simultaneous decompression of all q i and p i respectively will satisfy n j=1 (δ j − 1) of the constraints defined by equation (2). This is the case for pairs q 1 , p 1 and q 2 , p 2 with PSD constant γ = 18 = (35 + 1)/2.…”
Section: Simultaneous Decompressionmentioning
confidence: 99%
See 4 more Smart Citations
“…. , n}, each vector generated through simultaneous decompression of all q i and p i respectively will satisfy n j=1 (δ j − 1) of the constraints defined by equation (2). This is the case for pairs q 1 , p 1 and q 2 , p 2 with PSD constant γ = 18 = (35 + 1)/2.…”
Section: Simultaneous Decompressionmentioning
confidence: 99%
“…By Theorem 2.3, the search space can be restricted to decimation class representatives for each δ i -compression, q i . The case n = 2 is of particular interest as next five unsolved cases for LP existence are of length {77, 85, 87, 115, 117}, each the product of exactly two prime powers [2]. Let θ : {0, 1} → {0, 1} δ 1 ×δ 2 be the mapping of binary vectors of length to arrays of size δ 1 × δ 2 , with indices mapped as defined by equation ( 9).…”
Section: Simultaneous Decompressionmentioning
confidence: 99%
See 3 more Smart Citations