NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Back to Results
An upper bound for codes in a two-access binary erasure channelA 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.
Document ID
19780042413
Acquisition Source
Legacy CDMS
Document Type
Reprint (Version printed in journal)
Authors
Van Tilborg, H. C. A.
Date Acquired
August 9, 2013
Publication Date
January 1, 1978
Publication Information
Publication: IEEE Transactions on Information Theory
Volume: IT-24
Subject Category
Cybernetics
Accession Number
78A26322
Funding Number(s)
CONTRACT_GRANT: NAS7-100
Distribution Limits
Public
Copyright
Other

Available Downloads

There are no available downloads for this record.
No Preview Available