No label defined (Q4664666)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2154117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2154117 |
Statements
8 April 2005
0 references
binary superimposed code
0 references
0.8774883151054382
0 references
0.8754572868347168
0 references
0.8754572868347168
0 references
0.8731664419174194
0 references
The concept of a binary superimposed \((s,\ell)\)-code is introduced. A set \(C\) is called a superimposed \((s,\ell)\)-code (or, briefly, \((s,\ell)\)-code) if, for every pair of sets \(S,L\subset \{1,2,\dots,t\}\) such that \(| S| =s\), \(| L| =\ell\), and \(S\cap L=\varnothing\), there exists a position \(i\in \{1,2,\dots,N\}\) such that \(x_i(j)=1\) for all \(j\in L\), and \(x_i(j^{\prime})\) for all \(j^{\prime}\in S\). Upper and lower bounds on the rate of superimposed codes are given. For the entire collection see [Zbl 0944.00096].
0 references
