7796 search results - page 155 / 1560 » On Generalized Schur Numbers |
161
click to vote
TIT
2008
15 years 6 months ago
2008
For a linear code , the stopping redundancy of is defined as the minimum number of check nodes in a Tanner graph T for such that the size of the smallest stopping set in T is equal...
141
click to vote
AUTOMATICA
2002
15 years 6 months ago
2002
In this note, the problem of minimal-order stabilization in the case where the plant is minimum phase is studied. A low bound on the order of stabilizers is derived and a set of m...
200
click to vote
DM
2002
15 years 6 months ago
2002
Let G be a tree and let H be a collection of subgraphs of G, each having at most d connected components. Let (H) denote the maximum number of members of H no two of which share a ...
154
click to vote
TSP
2008
15 years 6 months ago
2008
In this paper, we present a powerful technique for the blind extraction of direct-sequence code-division multiple access (DS-CDMA) signals from convolutive mixtures received by an ...
180
click to vote
RSA
2011
15 years 1 months ago
2011
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...