Title: An upper bound for codes in a two-access binary erasure channel
Abstract: 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.
Publication Year: 1978
Publication Date: 1978-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 13
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot