RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1983 Volume 19, Issue 4, Pages 97–100 (Mi ppi1206)
Ņorrespondence

Universal Decoding for a Class of Deterministic Channels

A. V. Kuznetsov


Abstract: We derive upper and lower bounds on the maximum cardinality of a set of messages for which universal decoding is possible for an arbitrary class of deterministic channels that are assumed to be known while encoding.

UDC: 621.391.15

Received: 07.02.1983



Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026