2016•International Symposium on Information Theory and its ApplicationsRequires access

Formalization of binary symmetric erasure channel based on infotheo

Kyosuke NAKANO, Manabu Hagiwara

Abstract

In this paper, we formalize the channel capacity of the binary symmetric erasure channel (BSEC) by using a proof-assistant system called Coq/SSReflect. This study is for the formalization of the fact that the binary symmetric channel (BSC) and binary erasure channel (BEC), which were previously formalized, are specializations of the BSEC.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 3 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: Erasure, Binary erasure channel, Binary symmetric channel, Binary number, Channel (broadcasting), Computer science, Theoretical computer science, Algorithm