Error locating codes were first presented in 1963 by J.K. Wolf and B.Elspas. Since then several code design methods have been proposed. However, their algebraic structure has not yet been clarified. It is apparent that necessary and sufficient conditions for error correcting/detecting codes can be expressed by Hamming distance, but, on the other hand, those for error locating codes cannot always be expressed only by Hamming distance. This paper presents necessary and sufficient conditions for error locating codes by using a newly defined metric and a function. The function represents the number of bytes where Hamming distance between corresponding bytes of two codewords has a certain integer range. These conditions show that an error locating code having special code parameters is an error correcting/detecting code. This concludes that error locating codes include existing bit/byte error correcting/detecting codes in their special cases.

In this paper, we illustrate the analysis of microstrip structures with a large number of unknowns using the sparse-matrix/canonical grid method. This fast Fourier thansform (FFT) based iterative method reduces both CPU time and computer storage memory requirements. We employ the Mixed-Potential Integral Equation (MPIE) formulation in conjunction with the RWG triangular discretization. The required spatial-domain Green's functions are obtained efficiently and accurately using the Complex Image Method (CIM). The impedance matrix is decomposed into a sparse matrix which corresponds to near interactions and its complementary matrix which corresponds to far interactions among the subsectional current elements on the microstrip structures. During the iterative process, the near-interaction portion of the matrix -vector multiplication is computed directly as the conventional MPIE formulation. The far-interaction portion of the matrix-vector multiplication is computed indirectly using fast Fourier transforms (FFTs). This is achieved by a Taylor series expansion of the Green's function about the grid points of a uniformly-spaced canonical grid overlaying the triangular discretization.

Electromagnetic field diffracted by conducting circular disk and circular hole in the conducting plate is formulated by the method of Kobayashi potential. The field is expressed by linear combination of functions which satisfy the required boundary conditions except on the disk or hole. Thus the functions may be regarded as eigen functions of the configuration. By imposing the remaining boundary conditions, we can derive the matrix equations for the expansion coefficients. It may be verified readily that each eigen function satisfies edge conditions for induced current on the disk and for aperture field distribution on the hole. It may also be verified that the solutions for the disk and the hole satisfy Babinet's principle. Matrix elements of the equations for the expansion coefficients are given by two kinds of infinite integrals and the series solutions for these integrals are derived. The validity of these expressions are verified numerically by comparing with the results obtained from direct numerical integrations.

In this paper, a quite general systematic procedure is presented for defining incremental field contributions, that may provide effective tools for describing a wide class of scattering and diffraction phenomena at any aspect, whthin a unitary, self-consistent framework. This is based on a generalization of the localization process for cylindrical canonical problems with elementary source illumination and arbitrary observation aspects. In particular, it is shown that the spectral integral formulation of the exact solution may also be represented as a spatial integral convolution along the axis of the cylinder. Its integrand is then directly used to define the relevant incremental field contribution. This procedure, that will be referred to as a ITD (Incremental Theory of Diffraction) Fourier transform convolution localization process, is explicitly applied to both wedge and circular cylinder canonical configurations, to define incremental diffiraction and scattering contributions, respectively. These formulations are asymptotically approximated to find closed form high-frequency expression for the incremental field contributions. This generalization of the ITD lacalization process may provide a quite general, systematic procedure to find incremental field contributions that explicitly satisfy reciprocity and naturally lead to the UTD ray field representation, when it is applicable.

The integral kernel expansion method is applied to an analysis of scattering of magnetostatic forward volume waves (MSFVWs) by an array with any number of metal strips. In this method, first the integral kernel of the Fourier integral is expanded in terms of orthogonal polynomials to obtain moment equations. Then a system of algebraic equations is derived by applying the Galerkin's method. In the process, interaction between strips is naturally taken into account and real current distributions on the strips are determined such that boundary conditions are satisfied. Calculus confirmation through the energy conservation principle shows that numerical results are quite satisfactory. A comparison shows that theoretical results are in good agreement with experimental ones except the vicinity of lower and upper limits of the MSFVW band. It is shown that an infinite number of propagation modes is excited even if a wave of single mode is incident. Dependence of the scattering on dimension of arrays and on frequency and mode of an incident wave is obtained.

The H-polarized diffraction by a wedge consisting of perfect conductor and lossless dielectric is investigated by employing the dual integral equations. Its physical optics diffraction coefficients are expressed in a finite series of cotangent functions weighted by the Fresnel reflection coefficients. A correction rule is extracted from the difference between the diffraction coefficients of the physical optics field and those of the exact solution to a perfectly conducting wedge. The angular period of the cotangent functions is changed to satisfy the edge condition at the tip of the wedge, and the poles of the cotangent functions are relocated to cancel out the incident field in the artificially complementary region. Numerical results assure that the presented correction is highly effective for reducing the error posed in the physical optics solution.

Relations between well-known bounds for the minimum distance of binary cyclic codes such as BCH bound (dBCH), HT bound (dHT) and new bounds dA, dB proposed recently by Shen et al. are investigated. We prove firstly dBCH dA and secondly dHT dB. We also give binary cyclic codes which satisfy dA dHT.

In this paper, scattering problem of the directional coupler for the slab waveguides are analyzed by the mode-matching method in the sense of least squares for the lowest order even TE mode incidence. It is considered that the analysis of this coupler for the slab waveguides presents the fundamental data to design the directional coupler for the three dimensional waveguides. This directional coupler is composed of three parallel slabs which are placed at equal space in the dielectric medium. Respective slabs are core regions of three respective waveguides. The periodic groove structure of finite extent is formed on the both surfaces of core region of the central waveguide among them. The power of incident TE mode is coupled to other two waveguides through periodic groove structure. The coupled TE mode propagates in the other waveguides to the same or opposite direction for the direction of incident mode which propagates in the waveguide having periodic structure when the Bragg condition is selected appropriately. The scattered field of each region of this directional coupler is described by the superpositions of the plane waves with bandlimited spectra, respectively. These approximate wave functions are determined by the minimization of the mean-square boundary residual. This method results in the simultaneous Fredholm type integral equations of the second kind for these spectra. The first order approximate solutions of the integral equations are derived and the coupling efficiency and scattered fields are analyzed on the basis of those solutions in this paper.

A new optical wavelength demultiplexer using quasi-phase-matched sum-frequency-generation (QPM-SFG) is proposed. The device consists of an optical deflector using Pockels effect and a nonlinear crystal with a periodic structure. The demultiplexing characteristics of the device composed of a LiNbO3 crystal are analyzed theoretically. Wavelength demultiplexing can be made simply by changes in the electric field applied to the deflector.

This paper presents a method of analyzing the electromagnetic field inside an equipment housing. The electromagnetic field is assumed to be coming from outside and coupled into the housing through an aperture on the housing surface. The analysis is based on the transmission-line modeling method. Results of the analysis show a good agreement with the results of measurement. Also, it is found that the coupling through the aperture shows peaks at some frequencies that depend almost only on the structure of the housing and aperture and, therefore, can be estimated at the time of equipment design.

A family of nonce-based authentication and key distribution protocols based on the trusted third-party model are proposed which are not only efficient on the view points of computation and communication, but also secure against on-line and off-line password guessing attacks. A new concept of implicit or indirect challenge-response authentication which can be used to combine the processes of identify authentication and data integrity assurance during key distribution and to make the entire protocol be more concise and efficient is introduced in this paper. In the proposed family of protocols, specific protocol can be chosen such that the secure session key to be distributed is selected by specific participant in the protocol. Detailed security analyses of every protocols are given.

Recently, the low earth orbit satellite communications has been attracting much attention. These communications have many strong features, however, the communication performances are influenced by carrier frequency offset (CFO) and, particularly, it is hard to acquire the synchronization. A large number of publications have so far been made on the synchronization acquisition of DS/SS systems under CFO and most of them make use of the maximum likelihood decision in finding the maximum values of Fourier transform outputs. However, the implementations of Fourier transforms usually require high cost and large space. In this paper, we propose a new simple acquisition scheme using half-symbol differential decoding technique for DS/SS systems under CFO. This scheme makes use of the addition and subtraction of baseband signals and their delayed versions, (omitting Fourier transforms), together with integrations by recursive integrators, and thus resulting in much simpler implementation. In general, it is shown that the proposed scheme can acquire the code synchronization under carrier frequency offset with much smaller computational complexities and the sacrifice of longer acquisition time.

In this paper, we examine a new initial symbol acquisition method for M-ary spread-spectrum (M-ary/SS) signals that are affected by large carrier frequency offset. By the effect of the carrier frequency offset, preamble signal energy is dispersed to the undersired outputs. The proposed method is based on the collection of such dispersed signal energies by using reference patterns. The reference patterns are constructed by using the characteristic of Hadamard code sequences. The effectiveness of the proposed method is evaluated in terms of mean acquisition time.

In this paper we discuss the binary spreading sequences whose spectral distributions are DC free and spectral distribution's shapes can be easily controlled by a certain parameter denoted by δ. The newly developed sequences, referred to as modified antisymmetric M-sequences, are modified-versions of the conventional antisymmetric (AS)M-sequences. The proposed sequences are designed to increase the varieties of spectral distribution's shapes and improve the correlation properties when compared to those of the FM coded M-sequences which have already proposed by Tsuzuki et al. Some typical line coded M-sequences, i.e. the (differential) Manchester coded M-sequences and the FM coded M-sequences, and the conventional AS M-sequences are included in the set of proposed sequences. The improvement of the average BER (bit error rate) performance for asynchronous DS/SSMA (direct sequence/spread spectrum multiple access) systems using the proposed sequences in comparison to the system using the conventional AO/LSE (auto-optimal phase with least sidelobe energy) M-sequences is also shown.

Recently, Smith and Lennon proposed a new public key cryptosystem, called LUC, which uses the Lucas function as the one-way function in their cryptographic mechanisms instead of using the exponentiation function. They conjectured that LUC is cryptographically stronger than RSA in 1993. Since then, many weaknesses of LUC have been discoverd, e. g., similar to RSA, LUC also suffers from the chosen-message attacks and the evaluation in LUC is slightly less efficient than that in RSA. In this paper, we analyze another possible weakness of LUC that was not pointed out before. We show that the number of messages which cannot be concealed in LUC is at least as the same as that in RSA regardless of the choice of public keys. In particular, in many cases, the number of messages which cannot be concealed in LUC is greater than that in RSA. This implies that the choice of public keys in LUC needs more limitations than that used in RSA. Our results are useful to designers who consider to use LUC type systems.

The redundancy of universal lossy data compression for discrete memoryless sources is considered in terms of type and d-ball covering. It is shown that there exists a universal d-semifaithful code whose rate redundancy is upper bounded by (A-1/2)n-1ln n+o(n-1ln n), where A is the cardinality of source alphabet and n is the block length of the code. This new bound is tighter than known ones, and moreover, it turns out to be the attainable minimum of the universal coding proposed by Davisson.

This paper describes an efficient and simple coding algorithm of universally optimal codes for stationary (ergodic) sources and noiseless channel with unequal symbol costs. The symbol cost indicates the required time (or space) for the transmission (or storage) of that symbol, and the cost of any code symbol depends only on that symbol. The proposed coding algorithm mainly consists of two parts. The first part is based on the well-known Ziv-Lempel coding algorighm proposed in 1978 (sometimes called LZ78), and the second part is based on the Varn coding algorithm. The coding algorithm asymptotically achieves an optimal average cost of codes for stationary sources, and also achieves an optimal cost of codes for stationary ergodic sources with probability one. Furthermore, the computational complexity of the proposed coding algorithm is linear with respect to the length of source sequence and coded sequence.

This paper describes relation between the number of library pairs and error probability to have all the pairs as fixed points for second-order bidirectional associative memory (BAM). To estimate accurate error probability, three methods have been compared; (a) Gaussian approximation, (b) characteristic function method, and (c) Hermite Gaussian approximation (proposed by this paper). Comparison shows that Gaussian approximation is valid for the larger numbers of neurons in both two layers than 1000. While Hermite Gaussian approximation is applicable for the larger number of neurons than 30 when Hermite polynomials up to 8th are considered. Capacity of second-order BAM at the fixed error probability is estimated as the function of the number of neurons.

The numerical property of the recursive least squares (RLS) algorithm has been extensively, studied. However, very few investigations are reported concerning the numerical behavior of the predictor-based least squares (PLS) algorithms which provide the same least squares solutions as the RLS algorithm. In Ref. [9], we gave a comparative study on the numerical performances of the RLS and the backward PLS (BPLS) algorithms. It was shown that the numerical property of the BPLS algorithm is much superior to that of the RLS algorithm under a finite-precision arithmetic because several main instability sources encountered in the RLS algorithm do not appear in the BPLS algorithm. This paper theoretically shows the stability of the BPLS algorithm by error propagation analysis. Since the time-variant nature of the BPLS algorithm, we prove the stability of the BPLS algorithm by using the method as shown in Ref. [6]. The expectation of the transition matrix in the BPLS algorithm is analyzed and its eigenvalues are shown to have values within the unit circle. Therefore we can say that the BPLS algorithm is numerically stable.

In circuit simulation, dc operating points of nonlinear circuits are obtained by solving circuit equations. In this paper, we consider "hybrid equations" as the circuit equations and discuss the stability of dc operating points obtained by solving hybrid equations. We give a simple criterion for identifying unstable operating points from the information of the hybrid equations. We also give a useful criterion for identifying initial points from which homotopy methods coverge to stable operating points with high possibility. These results are derived from the theory of dc operating point stability developed by M. M. Green and A. N. Willson, Jr.