Nonexistence of a code for

In this paper, we shall prove that there is no [3q⁴-q³-q²-3q-1,5,3q⁴-4q³-2q+1]_q code over the finite field for q11. Thus, we conclude the nonexistence of a [g_q(5,d),5,d]_q code for 3q⁴-4q³-2q+1d3q⁴-4q³-q.     

An exponential example for Terlaky's pivoting rule for the criss-cross simplex method

Recently T. Terlaky has proposed a new pivoting rule for the criss-cross simplex method for linear programming and he proved that his rule is convergent. In this note we show that the required number of iterations may be exponential in the number of variables and constraints of the problem.     

Multiple Observations for Secret-Key Binding with SRAM PUFs

We present a new Multiple-Observations (MO) helper data scheme for secret-key binding to an SRAM-PUF. This MO scheme binds a single key to multiple enrollment observations of the SRAM-PUF. Performance is improved in comparison to classic schemes which generate helper data based on a single enrollment observation. The performance increase can be explained by the fact that the reliabilities of the different SRAM cells are modeled (implicitly) in the helper data. We prove that the scheme achieves secret-key capacity for any number of enrollment observations, and, therefore, it is optimal. We evaluate performance of the scheme using Monte Carlo simulations, where an off-the-shelf LDPC code is used to implement the linear error-correcting code. Another scheme that models the reliabilities of the SRAM cells is the so-called Soft-Decision (SD) helper data scheme. The SD scheme considers the one-probabilities of the SRAM cells as an input, which in practice are not observable. We present a new strategy for the SD scheme that considers the binary SRAM-PUF observations as an input instead and show that the new strategy is optimal and achieves the same reconstruction performance as the MO scheme. Finally, we present a variation on the MO helper data scheme that updates the helper data sequentially after each successful reconstruction of the key. As a result, the error-correcting performance of the scheme is improved over time.     

Trade-offs between Error Exponents and Excess-Rate Exponents of Typical Slepian–Wolf Codes

Typical random codes (TRCs) in a communication scenario of source coding with side information in the decoder is the main subject of this work. We study the semi-deterministic code ensemble, which is a certain variant of the ordinary random binning code ensemble. In this code ensemble, the relatively small type classes of the source are deterministically partitioned into the available bins in a one-to-one manner. As a consequence, the error probability decreases dramatically. The random binning error exponent and the error exponent of the TRCs are derived and proved to be equal to one another in a few important special cases. We show that the performance under optimal decoding can be attained also by certain universal decoders, e.g., the stochastic likelihood decoder with an empirical entropy metric. Moreover, we discuss the trade-offs between the error exponent and the excess-rate exponent for the typical random semi-deterministic code and characterize its optimal rate function. We show that for any pair of correlated information sources, both error and excess-rate probabilities exponential vanish when the blocklength tends to infinity.     

A Coupling Framework for Multi-Domain Modelling and Multi-Physics Simulations

This paper describes a coupling framework for parallel execution of different solvers for multi-physics and multi-domain simulations with an arbitrary number of adjacent zones connected by different physical or overlapping interfaces. The coupling architecture is based on the execution of several instances of the same coupling code and relies on the use of smart edges (i.e., separate processes) dedicated to managing the exchange of information between two adjacent regions. The collection of solvers and coupling sessions forms a flexible and modular system, where the data exchange is handled by independent servers that are dedicated to a single interface connecting two solvers’ sessions. Accuracy and performance of the strategy is considered for turbomachinery applications involving Conjugate Heat Transfer (CHT) analysis and Sliding Plane (SP) interfaces.     

On the use of symmetry in the ab initio quantum mechanical simulation of nanotubes and related materials

Nanotubes can be characterized by a very high point symmetry, comparable or even larger than the one of the most symmetric crystalline systems (cubic, 48 point symmetry operators). For example, N = 2n rototranslation symmetry operators connect the atoms of the (n,0) nanotubes. This symmetry is fully exploited in the CRYSTAL code. As a result, ab initio quantum mechanical large basis set calculations of carbon nanotubes containing more than 150 atoms in the unit cell become very cheap, because the irreducible part of the unit cell reduces to two atoms only. The nanotube symmetry is exploited at three levels in the present implementation. First, for the automatic generation of the nanotube structure (and then of the input file for the SCF calculation) starting from a two‐dimensional structure (in the specific case, graphene). Second, the nanotube symmetry is used for the calculation of the mono‐ and bi‐electronic integrals that enter into the Fock (Kohn‐Sham) matrix definition. Only the irreducible wedge of the Fock matrix is computed, with a saving factor close to N. Finally, the symmetry is exploited for the diagonalization, where each irreducible representation is separately treated. When M atomic orbitals per carbon atom are used, the diagonalization computing time is close to Nt, where t is the time required for the diagonalization of each 2M × 2M matrix. The efficiency and accuracy of the computational scheme is documented. © 2009 Wiley Periodicals, Inc. J Comput Chem, 2010     

Constructions of optimal difference systems of sets

Difference systems of sets (DSSs) are combinatorial configurations which were introduced in 1971 by Levenstein for the construction of codes for synchronization. In this paper, we present two kinds of constructions of difference systems of sets by using disjoint difference families and a special type of difference sets, respectively. As a consequence, new infinite classes of optimal DSSs are obtained.     

条形码技术在方志馆典藏工作中的应用

条形码技术是一种应用广泛的光电数据输入技术,具有编码、数据识别、数据采集、条码印刷等多项功能。本文简述了条形码技术的原理及其在方志馆编录、典藏、流通环节中的作用。论述了二维码技术的应用对方志馆在馆藏资料自动化管理和方志馆数字化建设方面产生的革命性影响。     

Bounds and Constructions for Two‐Dimensional Variable‐Weight Optical Orthogonal Codes

Optical orthogonal codes (1D constant‐weight OOCs or 1D CWOOCs) were first introduced by Salehi as signature sequences to facilitate multiple access in optical fibre networks. In fiber optic communications, a principal drawback of 1D CWOOCs is that large bandwidth expansion is required if a big number of codewords is needed. To overcome this problem, a two‐dimensional (2D) (constant‐weight) coding was introduced. Many optimal 2D CWOOCs were obtained recently. A 2D CWOOC can only support a single QoS (quality of service) class. A 2D variable‐weight OOC (2D VWOOC) was introduced to meet multiple QoS requirements. A 2D VWOOC is a set of 0, 1 matrices with variable weight, good auto, and cross‐correlations. Little is known on the construction of optimal 2D VWOOCs. In this paper, new upper bound on the size of a 2D VWOOC is obtained, and several new infinite classes of optimal 2D VWOOCs are obtained.