Results 21 to 30 of about 7,149,925 (323)
Entropy, 2020 In this paper, we obtain upper bounds on the minimum distance for turbo codes using fourth degree permutation polynomial (4-PP) interleavers of a specific interleaver length and classical turbo codes of nominal 1/3 coding rate, with two recursive ...
Lucian Trifina +3 more
doaj +1 more source
The minimum miss distance problem [PDF]
Proceedings of the American Mathematical Society, 1967 I. In the statement of most extant theorems concerning optimal control, a fundamental hypothesis is that of the existence of a control function which drives the controlled system from a given initial state to a specified target. Thus the utility of these theorems is contingent upon the solution of what is itself a fundamental and difficult problem of ...
Bridgland, T. F. jun., Hinkel, J. S.
openaire +1 more source
Minimum local distance density estimation [PDF]
Communications in Statistics - Theory and Methods, 2016 We present a local density estimator based on first order statistics. To estimate the density at a point, $x$, the original sample is divided into subsets and the average minimum sample distance to $x$ over all such subsets is used to define the density estimate at $x$. The tuning parameter is thus the number of subsets instead of the typical bandwidth
Tenorio, Luis +2 more
openaire +4 more sources
Prismatic mesh generation using minimum distance fields
, 2020 Anisotropic prismatic/strand meshes are often used to capture viscous boundary layer effects in Reynolds Averaged Navier Stokes (RANS) simulations of high Reynolds number flows.
B. Roget +3 more
semanticscholar +1 more source
Minimum orbital intersection distance: an asymptotic approach [PDF]
Astronomy & Astrophysics, 2019 The minimum orbital intersection distance (MOID) is used as a measure to assess potential close approaches and collision risks between astronomical objects. Methods to calculate this quantity have been proposed in several previous publications. The most frequent case is that in which both objects have elliptical osculating orbits.
J. M. Hedo +3 more
openaire +3 more sources
FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix
Molecular biology and evolution, 2009 Gene families are growing rapidly, but standard methods for inferring phylogenies do not scale to alignments with over 10,000 sequences. We present FastTree, a method for constructing large phylogenies and for estimating their reliability.
M. Price, Paramvir S. Dehal, A. Arkin
semanticscholar +1 more source
Lattice polytopes in coding theory [PDF]
, 2014 In this paper we discuss combinatorial questions about lattice polytopes motivated by recent results on minimum distance estimation for toric codes. We also prove a new inductive bound for the minimum distance of generalized toric codes.
Soprunov, Ivan
core +5 more sources
Minimum survivable graphs with bounded distance increase [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 We study in graphs properties related to fault-tolerance in case a node fails. A graph G is k-self-repairing, where k is a non-negative integer, if after the removal of any vertex no distance in the surviving graph increases by more than k. In the
Selma Djelloul, Mekkia Kouider
doaj +2 more sources
Minimum-Distance Based Construction of Multi-Kernel Polar Codes [PDF]
Global Communications Conference, 2017 In this paper, we propose a construction for multi-kernel polar codes based on the maximization of the minimum distance. Compared to the original construction based on density evolution, our new design shows particular advantages for short code lengths ...
Valerio Bioglio +3 more
semanticscholar +1 more source
Analysis and Design of Tuned Turbo Codes [PDF]
, 2012 It has been widely observed that there exists a fundamental trade-off between the minimum (Hamming) distance properties and the iterative decoding convergence behavior of turbo-like codes.
Costello, Daniel J. Jr. +6 more
core +2 more sources