The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we utilize negacyclic codes to construct a family of optimal subsystem codes with parameters [[q2+1,(q-1)2, 4, q-1]]q> where q = 1(mod4), q = pτ, τ ≥ 1 and p is an odd prime. These constructed quantum subsystem codes are different from those codes available in the literature.
The lifting scheme provides us a powerful tool for constructing biorthogonal wavelets. Meanwhile, it is a new explanation of first generation wavelets, i.e., any first generation wavelets filter can be decomposed into some lifting steps. A method of decomposing biorthogonal wavelets filters into lifting steps by solving equations is presented in this paper. The lifting coefficients can be obtained...
Motivated by various network improvement models, we study the problem to add some new edges to satisfy the increasing information demand and keep the underlying structure of the networks unchanged. In this paper we propose the general network expansion problem on the spanning tree in graphs (GNEST), then we present the polynomial equivalence between the GNEST problem and the constrained minimum spanning...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.