UPPER BOUND FOR CODES IN A 2-ACCESS BINARY ERASURE CHANNEL

被引：21

作者：

VANTILBORG, HCA

机构：

[1] Department of Mathematics, California Institute of Technology, Pasadena, CA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1978年 / 24卷 / 01期

关键词：

D O I：

10.1109/TIT.1978.1055814

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4. © 1978 IEEE

引用

页码：112 / 116

页数：5