A Legendre pair of length 77 using complementary binary matrices with fixed marginals
نویسندگان
چکیده
We provide a search method for Legendre pairs of composite length based on generating binary matrices with fixed row and column sums from compressed, complementary integer vectors. This approach yielded the first construction pair 77, as well exhaustive generation 55.
منابع مشابه
Comparing the Switch and Curveball Markov Chains for Sampling Binary Matrices with Fixed Marginals
The Curveball algorithm is a variation on well-known switch-based Markov Chain Monte Carlo approaches for the uniform sampling of binary matrices with fixed row and column sums. We give a spectral gap comparison between switch chains and the Curveball chain using a decomposition of the switch chain based on Johnson graphs. In particular, this comparison allows us to prove that the Curveball Mar...
متن کاملReconstruction of binary matrices under fixed size neighborhood constraints
Using a dynamic programming approach, we prove that a large variety of matrix reconstruction problems from two projections can be solved in polynomial timewhenever the number of rows (or columns) is fixed. We also prove some complexity results for several problems concerning the reconstruction of a binary matrix when a neighborhood constraint occurs. © 2008 Elsevier B.V. All rights reserved.
متن کاملSimulation of multivariate distributions with fixed marginals and correlations
Consider the problem of drawing random variates (X1, . . . , Xn) from a distribution where the marginal of each Xi is specified, as well as the correlation between every pair Xi and Xj . For given marginals, the Fréchet-Hoeffding bounds put a lower and upper bound on the correlation between Xi and Xj . Hence any achievable correlation can be uniquely represented by a convexity parameter λij ∈ [...
متن کاملOn extremal quantum states of composite systems with fixed marginals
We study the convex set C (ρ1,ρ2) of all bipartite quantum states with fixed marginal states ρ1 and ρ2. The extremal states in this set have recently been characterized by Parthasarathy [Ann. Henri Poincaré (to appear), quant-ph/0307182, [1]]. Here we present an alternative necessary and sufficient condition for a state in C (ρ1,ρ2) to be extremal. Our approach is based on a canonical duality b...
متن کاملE ective Variable - Length - to - Fixed - Length Coding via a Re - Pair Algorithm
We address the problem of improving variable-length-toxed-length codes (VF codes). A VF code is an encoding scheme that uses a xed-length code, and thus, one can easily access the compressed data. However, conventional VF codes usually have an inferior compression ratio to that of variable-length codes. Although a method proposed by T. Uemura et al. in 2010 achieves a good compression ratio com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Designs, Codes and Cryptography
سال: 2021
ISSN: ['0925-1022', '1573-7586']
DOI: https://doi.org/10.1007/s10623-021-00862-y