In this paper, two upper bounds on the achievable code rate of linear block codes for multiple phased-burst correction (MPBC) are presented. One bound is constrained to a maximum correctable cyclic burst length within every subblock, or equivalently a constraint on the minimum error free length or gap within every phased-burst. This bound, when reduced to the special case of a bound for single ...

This article describes the current state of syntactic analysis of Estonian using Constraint Grammar. Constraint Grammar framework divides parsing into two different modules: morphological disambiguation and determination of syntactic functions. This article focuses on the last module in detail. If the morphological disambiguator achieves the precision more than 85% and error rate is smaller tha...

Due to the advantages of high information densities and longevity, DNA storage systems have begun attract a lot attention. However, common obstacles are caused by insertion, deletion, substitution errors occurring in synthesis sequencing. In this paper, we first explain method convert binary data into general maximum run-length $r$ sequences with specific length construction, which can be used ...

In this paper, we propose to leverage the simple and explicit parity checks inherent in low-density parity-check (LDPC) codes to realize dominant error events detection without code rate penalty. This is enabled by enforcing a very weak constraint on LDPC code parity check matrix structure. Such a constraint can be readily satisfied by most structured LDPC codes ever studied in the open literat...

We consider uncertainty classes of noise distributions defined by a bound on the divergence with respect to a nominal noise distribution. The noise that maximizes the minimum error probability for binary-input channels is found. The effect of the reduction in uncertainty brought about by knowledge of the signal-to-noise ratio is also studied. The particular class of Gaussian nominal distributio...

Adaptive finite element methods for optimization problems for second order linear elliptic partial differential equations subject to pointwise constraints on the `-norm of the gradient of the state are considered. In a weak duality setting, i.e. without assuming a constraint qualification such as the existence of a Slater point, residual based a posteriori error estimators are derived. To overc...

The uncertainty involved in the gradient constraint for optical ow detection is often modeled as constant Gaussian noise added to the time-derivative of the image intensity. In this paper, we examine this modeling closely and investigate the error behavior by doing simulation. Our result indicates that the error depends on both the spatial derivatives and the image motion. We propose alternativ...

The error in the molecular dipole moment as derived from accurate X-ray diffraction data is shown to be origin dependent in the general case. It is independent of the choice of origin if an electroneutrality constraint is introduced, even when additional constraints are applied to the monopole populations. If a constraint is not applied to individual moieties, as is appropriate for multicompone...

For plecewise linear approximation of variational inequalities associated with the mildly nonlinear elliptic boundary value problems having auxiliary constraint conditions, we prove that the error estimate for u-uh in the W 1’2norm is of order h. KEV WORDS AND PHRASES. Fine Element, V)nal Inequalities, Approximation, Mdly nonlinear. 1980 THEMATICS SUBJECT CLASSIFICATION CODES. Primary 5J20, 65N...

We present and discuss a method to relax sets described by finitely many smooth convex inequality constraints by the level set of a single smooth convex inequality constraint. Based on error bounds and Lipschitz continuity, special attention is paid to the maximal approximation error and a guaranteed safety margin. Our results allow to safely avoid the obstacle by obeying a single smooth constr...