Abstract: For enabling single sign-on among applications, a linkage ID indicating connection between the authentication apparatus 1 including the client function and the server apparatus 2 is shared among a plurality of applications. For that, a SV information management unit Aa of the authentication apparatus 1 having the client function manages the linkage ID by storing it in a predetermined storing unit. An AP information management unit Ab manages and stores connection information between applications in a predetermined storing unit, wherein the connection information includes an application name corresponding to an application. Then, an AP decision unit determines whether an application name included in a received linkage ID request is registered in the AP information management unit Ab, obtains the linkage ID from the SV information management unit Aa when the application name is registered in the AP information management unit Ab, and returns the linkage ID to a source of the linkage ID request.

Abstract: For enabling single sign-on among applications, a linkage ID indicating connection between the authentication apparatus 1 including the client function and the server apparatus 2 is shared among a plurality of applications. For that, a SV information management unit Aa of the authentication apparatus 1 having the client function manages the linkage ID by storing it in a predetermined storing unit. An AP information management unit Ab manages and stores connection information between applications in a predetermined storing unit, wherein the connection information includes an application name corresponding to an application. Then, an AP decision unit determines whether an application name included in a received linkage ID request is registered in the AP information management unit Ab, obtains the linkage ID from the SV information management unit Aa when the application name is registered in the AP information management unit Ab, and returns the linkage ID to a source of the linkage ID request.

Abstract: In a simple decoder which decodes convolutional codes of constraint length K and coding rate n/m, encoded data which is supplied thereto in steps of m bits are distributed, bit by bit, to m shift registers each having x=[(K-1)/(m-n)] series-connected shift stages. Here, [p] means the minimum integer equal to or larger than a real number p. The connection of n modulo-2 addition circuits to all the shift stages of all the shift registers is defined by n decoding generative vectors which define n decoding generative polynomials. The modulo-2 addition circuits perform modulo-2 additions of the outputs of the shift stages connected thereto and output n results of additions as decoded results of n bits. The n decoding generative vectors are selected from decoding generative vectors of N rows which are obtained as an inverse matrix of a square matrix whose elements are N.times.N coefficients which define N=mx convolutional code generating polynomials.