Distance increasing mapping for variable distance block code
نویسندگان
چکیده
منابع مشابه
Ela Block Distance Matrices
In this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by D ij = F ii +F jj −2F ij. When each block in F is 1 × 1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interes...
متن کاملBlock distance matrices
In this paper, block distance matrices are introduced. Suppose F is a square block matrix in which each block is a symmetric matrix of some given order. If F is positive semidefinite, the block distance matrix D is defined as a matrix whose (i, j)-block is given by Dij = Fii+Fjj−2Fij . When each block in F is 1 × 1 (i.e., a real number), D is a usual Euclidean distance matrix. Many interesting ...
متن کاملOn the Remarkable Formula for Spectral Distance of Block Southeast Submatrix
This paper presents a remarkable formula for spectral distance of a given block normal matrix $G_{D_0} = begin{pmatrix} A & B \ C & D_0 end{pmatrix} $ to set of block normal matrix $G_{D}$ (as same as $G_{D_0}$ except block $D$ which is replaced by block $D_0$), in which $A in mathbb{C}^{ntimes n}$ is invertible, $ B in mathbb{C}^{ntimes m}, C in mathbb{C}^{mti...
متن کاملWeighted Distance Mapping (WDM)
A new method is introduced for describing, visualizing, and inspecting data spaces. It is based on an adapted version of the Fast Exact Euclidean Distance (FEED) transform. It computes a description of the complete data space based on partial data. Combined with a metric, a true Weighted Distance Map (WDM) can be computed, which can define a probability space. Subsequently, distances between da...
متن کاملEdit Distance with Block Deletions
Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves. We show that the edit distance with block moves and block deletions is NP-complete (Nondeterministic Polynomial time problems in which any given s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Communications
سال: 2020
ISSN: 1751-8636,1751-8636
DOI: 10.1049/iet-com.2019.0875