اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistance preserving mappings from ternary vectors to permutations
148
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Distance-preserving mappings (DPMs) are mappings from the set of all q-ary vectors of a fixed length to the set of permutations of the same or longer length such that every two distinct vectors are mapped to permutations with the same or even larger Hamming distance than that of the vectors. In this paper, we propose a construction of DPMs from ternary vectors. The constructed DPMs improve the lower bounds on the maximal size of permutation arrays.
قيم البحث
اقرأ أيضاً
In this paper, we investigate the symbol-level precoding (SLP) design problem in the downlink of a multiuser multiple-input single-output (MISO) channel. We consider generic constellations with any arbitrary shape and size, and confine ourselves to o
ne of the main categories of constructive interference regions (CIR), namely, distance preserving CIR (DPCIR). We provide a comprehensive study of DPCIRs and derive some properties for these regions. Using these properties, we first show that any signal in a given DPCIR has a norm greater than or equal to the norm of the corresponding constellation point if and only if the convex hull of the constellation contains the origin. It is followed by proving that the power of the noiseless received signal lying on a DPCIR is a monotonic strictly increasing function of two parameters relating to the infinite Voronoi edges. Using the convex description of DPCIRs and their properties, we formulate two design problems, namely, the SLP power minimization with signal-to-interference-plus-noise ratio (SINR) constraints, and the SLP SINR balancing problem under max-min fairness criterion. The SLP power minimization based on DPCIRs can straightforwardly be written as a quadratic program (QP). We provide a simplified reformulation of this problem which is less computationally complex. The SLP max-min SINR, however, is non-convex in its original form, and hence difficult to tackle. We propose several alternative optimization approaches, including semidefinite program (SDP) formulation and block coordinate descent (BCD) optimization. We discuss and evaluate the loss due to the proposed alternative methods through extensive simulation results.
In this paper we present a simple framework to study various distance problems of permutations, including the transposition and block-interchange distance of permutations as well as the reversal distance of signed permutations. These problems are ver
y important in the study of the evolution of genomes. We give a general formulation for lower bounds of the transposition and block-interchange distance from which the existing lower bounds obtained by Bafna and Pevzner, and Christie can be easily derived. As to the reversal distance of signed permutations, we translate it into a block-interchange distance problem of permutations so that we obtain a new lower bound. Furthermore, studying distance problems via our framework motivates several interesting combinatorial problems related to product of permutations, some of which are studied in this paper as well.
It is well known that the product of two independent regularly varying random variables with the same tail index is again regularly varying with this index. In this paper, we provide sharp sufficient conditions for the regular variation property of p
roduct-type functions of regularly varying random vectors, generalizing and extending the univariate theory in various directions. The main result is then applied to characterize the regular variation property of products of iid regularly varying quadratic random matrices and of solutions to affine stochastic recurrence equations under non-standard conditions.
How can $d+k$ vectors in $mathbb{R}^d$ be arranged so that they are as close to orthogonal as possible? In particular, define $theta(d,k):=min_Xmax_{x eq yin X}|langle x,yrangle|$ where the minimum is taken over all collections of $d+k$ unit vectors
$Xsubseteqmathbb{R}^d$. In this paper, we focus on the case where $k$ is fixed and $dtoinfty$. In establishing bounds on $theta(d,k)$, we find an intimate connection to the existence of systems of ${k+1choose 2}$ equiangular lines in $mathbb{R}^k$. Using this connection, we are able to pin down $theta(d,k)$ whenever $kin{1,2,3,7,23}$ and establish asymptotics for general $k$. The main tool is an upper bound on $mathbb{E}_{x,ysimmu}|langle x,yrangle|$ whenever $mu$ is an isotropic probability mass on $mathbb{R}^k$, which may be of independent interest. Our results translate naturally to the analogous question in $mathbb{C}^d$. In this case, the question relates to the existence of systems of $k^2$ equiangular lines in $mathbb{C}^k$, also known as SIC-POVM in physics literature.
In the group testing problem we aim to identify a small number of infected individuals within a large population. We avail ourselves to a procedure that can test a group of multiple individuals, with the test result coming out positive iff at least o
ne individual in the group is infected. With all tests conducted in parallel, what is the least number of tests required to identify the status of all individuals? In a recent test design [Aldridge et al. 2016] the individuals are assigned to test groups randomly, with every individual joining an equal number of groups. We pinpoint the sharp threshold for the number of tests required in this randomised design so that it is information-theoretically possible to infer the infection status of every individual. Moreover, we analyse two efficient inference algorithms. These results settle conjectures from [Aldridge et al. 2014, Johnson et al. 2019].
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
