2011•Unpublished venueRequires access

Channel coding theorem for the number of guesses in decoding

H. Yamamoto, Okudera Keishi

Abstract

Arikan and Merhav proved joint source-channel coding theorems for guessing decoders based on Gallager's method. But, in this paper, only channel coding is considered to derive a stronger channel coding theorem for constant composition universal codes based on the method of types. Furthermore, the coding theorem is applied to the wiretap channel coding problem.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Decoding methods, Variable-length code, Shannon–Fano coding, Coding (social sciences), Channel code, Tunstall coding, Channel (broadcasting), Computer science