8,822 research outputs found
Further results on covering codes with radius R and codimension tR + 1
The length function is the smallest possible length of a -ary linear code with codimension (redundancy) and covering
radius . Let be the smallest size of a -saturating set
in the projective space . There is a one-to-one
correspondence between codes and -saturating -sets in
that implies . In this work, for
, new asymptotic upper bounds on are obtained in the
following form:
The new bounds are essentially better than the known ones. For , a new
construction of -saturating sets in the projective space
, providing sets of small sizes, is proposed. The
codes, obtained by the construction, have minimum distance , i.e. they are almost MDS (AMDS) codes. These codes are taken as the
starting ones in the lift-constructions (so-called "-concatenating
constructions") for covering codes to obtain infinite families of codes with
growing codimension , .Comment: 24 pages. arXiv admin note: text overlap with arXiv:2108.1360
On upper bounds on the smallest size of a saturating set in a projective plane
In a projective plane (not necessarily Desarguesian) of order
a point subset is saturating (or dense) if any point of is collinear with two points in. Using probabilistic methods, the
following upper bound on the smallest size of a saturating set in
is proved: \begin{equation*} s(2,q)\leq 2\sqrt{(q+1)\ln
(q+1)}+2\thicksim 2\sqrt{q\ln q}. \end{equation*} We also show that for any
constant a random point set of size in with is a saturating
set with probability greater than Our probabilistic
approach is also applied to multiple saturating sets. A point set is -saturating if for every point of the number of secants of through is at least , counted with
multiplicity. The multiplicity of a secant is computed as
The following upper bound on the smallest
size of a -saturating set in is proved:
\begin{equation*} s_{\mu }(2,q)\leq 2(\mu +1)\sqrt{(q+1)\ln (q+1)}+2\thicksim
2(\mu +1)\sqrt{ q\ln q}\,\text{ for }\,2\leq \mu \leq \sqrt{q}. \end{equation*}
By using inductive constructions, upper bounds on the smallest size of a
saturating set (as well as on a -saturating set) in the projective
space are obtained.
All the results are also stated in terms of linear covering codes.Comment: 15 pages, 24 references, misprints are corrected, Sections 3-5 and
some references are adde
A single-photon sampling architecture for solid-state imaging
Advances in solid-state technology have enabled the development of silicon
photomultiplier sensor arrays capable of sensing individual photons. Combined
with high-frequency time-to-digital converters (TDCs), this technology opens up
the prospect of sensors capable of recording with high accuracy both the time
and location of each detected photon. Such a capability could lead to
significant improvements in imaging accuracy, especially for applications
operating with low photon fluxes such as LiDAR and positron emission
tomography.
The demands placed on on-chip readout circuitry imposes stringent trade-offs
between fill factor and spatio-temporal resolution, causing many contemporary
designs to severely underutilize the technology's full potential. Concentrating
on the low photon flux setting, this paper leverages results from group testing
and proposes an architecture for a highly efficient readout of pixels using
only a small number of TDCs, thereby also reducing both cost and power
consumption. The design relies on a multiplexing technique based on binary
interconnection matrices. We provide optimized instances of these matrices for
various sensor parameters and give explicit upper and lower bounds on the
number of TDCs required to uniquely decode a given maximum number of
simultaneous photon arrivals.
To illustrate the strength of the proposed architecture, we note a typical
digitization result of a 120x120 photodiode sensor on a 30um x 30um pitch with
a 40ps time resolution and an estimated fill factor of approximately 70%, using
only 161 TDCs. The design guarantees registration and unique recovery of up to
4 simultaneous photon arrivals using a fast decoding algorithm. In a series of
realistic simulations of scintillation events in clinical positron emission
tomography the design was able to recover the spatio-temporal location of 98.6%
of all photons that caused pixel firings.Comment: 24 pages, 3 figures, 5 table
- β¦