Learn More
In this paper, a new randomness test is proposed based on the T-complexity of a T-code, which is a variable-length self-synchronizing code introduced by Titchener in 1984. The proposed test can be used instead of the Lempel-Ziv compression test, which was removed from the NIST statistical test suite because the LZ-complexity has a defect such that its(More)
Recently Linear Programming (LP) decoding is attracting much attention as an alternative to Belief Propagation (BP) decoding for LDPC codes. It is well known for the BP decoding that nonbinary LDPC codes can improve the decoding error probability considerably. On the other hand, Flanagan et al. proposed an LP decoding scheme for LDPC codes over finite(More)
The bit commitment can be realized by using a noisy channel. Winter-Nascimento-Imai showed that the bit commitment capacity of a noisy channel is given by C<sub>b</sub> = max<sub>pN</sub>H(X\Y) where X and Y are the input and output of the channel. In this paper, the idea of a multiplex coding, which was first introduced into the coding problem of a wiretap(More)
This paper presents a reordering model using syntactic information of a source tree for phrase-based statistical machine translation. The proposed model is an extension of IST-ITG (imposing source tree on inversion trans-duction grammar) constraints. In the proposed method, the target-side word order is obtained by rotating nodes of the source-side(More)
We proposed a scheme of distributed verification for problems that are not solved efficiently in parallel. We focused the fact that computation of verification is solved efficiently in parallel even if the original problem is not solved efficiently. We adopt grid computing for verification computation in the scheme. In the scheme, we assume that we can use(More)
In this paper, we extend the work by M. Naor [7] on deniable ring authentication to include key establishment. Two secure deniable private key establishment protocols will be proposed. These two related schemes create only a secure private channel between Alice and Bob where the identity of Bob remains completely hidden. The first scheme does not require(More)
Linear code linear programming (LCLP) proposed by Feldman is one of the promising methods to implement the lossy source coding process efficiently. In the encoding and decoding of a lossy source code constructed by sparse matrices, we propose auxiliary methods to obtain approximate optimal values in the case where the output of LCLP takes non-integer(More)
  • 1