NASA NTRS · 19780042413
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.
Keep this discovery
Explore connections, maps & timelines
Van Tilborg, H. C. A.. 1978-01-01. An upper bound for codes in a two-access binary erasure channel. https://ntrs.nasa.gov/citations/19780042413
Cite the original work for its findings. Save a collection to share your selection of sources.