Linear inequalities for covering codes. I. Pair covering inequalities

1991 ◽  
Vol 37 (3) ◽  
pp. 573-582 ◽  
Author(s):  
Z. Zhang
Keyword(s):  
Linear Inequalities ◽  
Covering Codes

scholarly journals Ternary Covering Codes

10.37236/1281 ◽  
1996 ◽  
Vol 3 (2) ◽  
Author(s):  
Laurent Habsieger
Keyword(s):  
Lower Bounds ◽  
Covering Radius ◽  
Linear Inequalities ◽  
Characteristic Functions ◽  
Binary Codes ◽  
Covering Codes ◽  
Congruence Properties

In [5], we studied binary codes with covering radius one via their characteristic functions. This gave us an easy way of obtaining congruence properties and of deriving interesting linear inequalities. In this paper we extend this approach to ternary covering codes. We improve on lower bounds for ternary $1$-covering codes, the so-called football pool problem, when $3$ does not divide $n-1$. We also give new lower bounds for some covering codes with a covering radius greater than one.

Characterization of the conditional stationary distribution in Markov chains via systems of linear inequalities

2020 ◽  
Vol 52 (4) ◽  
pp. 1249-1283
Author(s):  
Masatoshi Kimura ◽  
Tetsuya Takine
Keyword(s):  
Markov Chains ◽  
Stationary Distribution ◽  
Continuous Time ◽  
State Transition ◽  
Convex Polytope ◽  
Linear Inequalities ◽  
Systems Of Linear Inequalities ◽  
Free Sets ◽  
Practical Implications

AbstractThis paper considers ergodic, continuous-time Markov chains $\{X(t)\}_{t \in (\!-\infty,\infty)}$ on $\mathbb{Z}^+=\{0,1,\ldots\}$ . For an arbitrarily fixed $N \in \mathbb{Z}^+$ , we study the conditional stationary distribution $\boldsymbol{\pi}(N)$ given the Markov chain being in $\{0,1,\ldots,N\}$ . We first characterize $\boldsymbol{\pi}(N)$ via systems of linear inequalities and identify simplices that contain $\boldsymbol{\pi}(N)$ , by examining the $(N+1) \times (N+1)$ northwest corner block of the infinitesimal generator $\textbf{\textit{Q}}$ and the subset of the first $N+1$ states whose members are directly reachable from at least one state in $\{N+1,N+2,\ldots\}$ . These results are closely related to the augmented truncation approximation (ATA), and we provide some practical implications for the ATA. Next we consider an extension of the above results, using the $(K+1) \times (K+1)$ ( $K > N$ ) northwest corner block of $\textbf{\textit{Q}}$ and the subset of the first $K+1$ states whose members are directly reachable from at least one state in $\{K+1,K+2,\ldots\}$ . Furthermore, we introduce new state transition structures called (K, N)-skip-free sets, using which we obtain the minimum convex polytope that contains $\boldsymbol{\pi}(N)$ .

On the distribution of integer random variables related by two linear inequalities: I

2008 ◽  
Vol 83 (3-4) ◽  
pp. 512-529 ◽  
Author(s):  
V. P. Maslov ◽  
V. E. Nazaikinskii
Keyword(s):  
Random Variables ◽  
Linear Inequalities

THE “KVAZAR” PACKAGE FOR PATTERN RECOGNITION AND ITS APPLICATIONS

1993 ◽  
Vol 03 (04) ◽  
pp. 439-444 ◽  
Author(s):  
VLADIMIR S. KAZANTSEV
Keyword(s):  
Experimental Data ◽  
Pattern Recognition ◽  
Data Analysis ◽  
Linear Inequalities ◽  
Processing Data ◽  
Experimental Data Analysis ◽  
Ibm Pc

The package of applied programs named KVAZAR has been elaborated to be used for classification, diagnostic, predicative, experimental data analysis problems. The package may be used in medicine, biology, geology, economics, engineering and some other problems. The algorithmical base of the package is the method of pattern recognition, based on the linear inequalities and committee constructions. Other algorithms are used too. The package KVAZAR is intended to be used with IBM PC AT/XT. The range of processing data is bounded by 40,000 numbers.

Sum-free sets and short covering codes

2010 ◽  
Vol 39 (6) ◽  
Author(s):  
Emerson Carmelo ◽  
Candido Mendonça
Keyword(s):  
Covering Codes ◽  
Short Covering ◽  
Free Sets
Sign in / Sign up

Export Citation Format

Share Document