In this paper, the duality of erasures and defects will be investigated bycomparing the binary erasure channel (BEC) and the binary defect channel (BDC).The duality holds for channel capacities, capacity achieving schemes, minimumdistances, and upper bounds on the probability of failure to retrieve theoriginal message. Also, the binary defect and erasure channel (BDEC) will beintroduced by combining the properties of the BEC and the BDC. It will be shownthat the capacity of the BDEC can be achieved by the coding scheme thatcombines the encoding for the defects and the decoding for the erasures. Thiscoding scheme for the BDEC has two separate redundancy parts for correctingerasures and masking defects. Thus, we will investigate the problem ofredundancy allocation between these two parts.
展开▼
