Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Coded Compressed Sensing with List Recoverable Codes for the Unsourced
  Random Access   We consider a coded compressed sensing approach for the unsourced random
access and replace the outer tree code proposed by Amalladinne et al. with the
list recoverable code capable of correcting t errors. A finite-length random
coding bound for such codes is derived. The numerical experiments in the single
antenna quasi-static Rayleigh fading MAC show that transition to list
recoverable codes correcting t errors improves the performance of coded
compressed sensing scheme by 7-10 dB compared to the tree code-based scheme. We
propose two practical constructions of outer codes. The first is a modification
of the tree code. It utilizes the same code structure, and a key difference is
a decoder capable of correcting up to t errors. The second is based on the
Reed-Solomon codes and Guruswami-Sudan list decoding algorithm. The first
scheme provides an energy efficiency very close to the random coding bound when
the decoding complexity is unbounded. But for the practical parameters, the
second scheme is better and improves the performance of a tree code-based
scheme when the number of active users is less than 200.

31
The categories of this paper are: ao-sci
3
The categories of this paper are: physics
22
The categories of this paper are: chao-dyn
21
The categories of this paper are: adap-org
14
The categories of this paper are: math-ph
33
The categories of this paper are: plasm-ph
6
The categories of this paper are: astro-ph
29
The categories of this paper are: funct-an
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
15
The categories of this paper are: nucl-ex
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
37
The categories of this paper are: supr-con
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc