Learn More
— The reliability-based heuristic search methods for maximum likelihood decoding (MLD) generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Test error patterns are stored in lists and its space complexity is crucially large for MLD of long block codes. One of the well-known heuristic search methods for(More)
—The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. The optimal quantizer, in the sense of maximizing mutual information between the channel input and the quantizer output, may be found by an algorithm with complexity which is quadratic in the number of channel outputs. This is a concave(More)
BACKGROUND Mammalian erythropoiesis can be divided into two distinct types, primitive and definitive, in which new cells are derived from the yolk sac and hematopoietic stem cells, respectively. Primitive erythropoiesis occurs within a restricted period during embryogenesis. Primitive erythrocytes remain nucleated, and their hemoglobins are different from(More)
SUMMARY We study a modification method for constructing low-density parity-check (LDPC) codes for solid burst erasures. Our proposed modification method is based on a column permutation technique for a parity-check matrix of the original LDPC codes. It can change the burst erasure correction capabilities without degradation in the performance over random(More)
— In this paper, reliability-based heuristic search methods for maximum likelihood decoding of block codes are considered. Based on the decoding algorithm by Battail and Fang (and its improved technique by Valembois and Fossorier), we deduce a method of reducing the space complexity of the heuristic search maximum likelihood decoding algorithm. The proposed(More)
In this paper, we discuss collusion-secure traceability codes for digital fingerprinting which is a technique for copyright protection of digital contents. We first state a generalization of conventional collusion attacks where illicit users of a digital content collude to create an illegal digital content. Then we propose a collusion-secure traceability(More)
We study a simple four node network in which cooperation improves the information-theoretic secrecy. The channel model consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver, while the eavesdropper tries to decode the transmitted message. The main result is the derivation of a newly(More)