Achieving positive rates with predetermined dictionaries

DOI10.1007/978-3-030-67899-9_31arXiv2012.10897MaRDI QIDQ6356538

Publication date: 20 December 2020

Abstract: In the first part of the paper we consider binary input channels that are not necessarily stationary and show how positive rates can be achieved using codes constrained to be within predetermined dictionaries. We use a Gilbert-Varshamov-like argument to obtain the desired rate achieving codes. Next we study the corresponding problem for channels with arbitrary alphabets and use conflict-set decoding to show that if the dictionaries are contained within nice sets, then positive rates are achievable.

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Information theory (general) (94A15) Coding theorems (Shannon theory) (94A24)

This page was built for publication: Achieving positive rates with predetermined dictionaries

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