Unsourced Random Access Based on List Recoverable Codes Correcting t Errors

Kirill Andreev, Pavel Rybin, Alexey Frolov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Citations (Scopus)

Abstract

We consider the unsourced random access based on a coded compressed sensing approach. The main idea is to replace the outer tree code proposed by Amalladinne et al. with the code capable of correcting t errors. We derive a finite-length random coding bound for such codes and suggest a practical code construction. We have conducted numerical experiments in the single antenna quasi-static Rayleigh fading MAC. The results show that transition to list-recoverable codes correcting t errors allows performance improvement of coded compressed sensing scheme by 7-10 dB compared to the tree code-based scheme.

Original languageEnglish
Title of host publication2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781665403122
DOIs
Publication statusPublished - 2021
Event2021 IEEE Information Theory Workshop, ITW 2021 - Virtual, Online, Japan
Duration: 17 Oct 202121 Oct 2021

Publication series

Name2021 IEEE Information Theory Workshop, ITW 2021 - Proceedings

Conference

Conference2021 IEEE Information Theory Workshop, ITW 2021
Country/TerritoryJapan
CityVirtual, Online
Period17/10/2121/10/21

Fingerprint

Dive into the research topics of 'Unsourced Random Access Based on List Recoverable Codes Correcting t Errors'. Together they form a unique fingerprint.

Cite this