scientific article; zbMATH DE number 4135867

From MaRDI portal
Publication:3469037





Let \(1\leq s<t\), \(1<D<N\) be integers, \([N]\) be the set of integers from \(1\) to \(N\), \(\Omega_j\subset [N]\), \(j=1,\ldots, t\), be subsets of \([N]\) such that the number of elements \(| \Omega_j| > D\). A family of subsets \(\Omega_1,\Omega_2,\ldots,\Omega_t\) is called an \((s,N,D)\)-family if, for any collection of integers \(m_1,m_2,\ldots, m_{s+1}\), \(m_i\neq m_j\), \(m_i\in [t]\) it is true that \(| \Omega_{m_{s+1}}\setminus \cup^{s}_{k=1}\Omega_{m_k}| \geq D\). Let \(\vec{x}(j)\) be the indicator vector of \(\Omega_j\) and \(X\) the \((0,1)^N\times t\) matrix whose \(j\)-th column is \(\vec{x}(j)\). The matrix \(X\) corresponding to an \((s,N,D)\) family is called a superimposed distance code (SDC) of strength \(j\), length \(N\), volume \(t\) and superimposed distance \(D\). Let \(t(s,N,D)\) be the maximal possible volume of an SDC and define the rate as \[ R_s(d) = \limsup_{N\to \infty}\frac{\log t(s,N,D)}{N}. \] The paper obtains upper and lower bounds on this rate.




Cited in
(29)








This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3469037)