The separating redundancy is an important property in the analysis of the error-and-erasure decoding of a linear block code. In this work, we investigate the separating redundancy of the duals of first-order generalized Reed-Muller (GRM) codes, a class of nonbinary linear block codes that have nice algebraic properties. The dual of a first-order GRM code can be specified by two positive integers m and q and denoted by R(m,q), where q is the power of a prime number and q≠2. We determine the first separating redundancy value of R(m,q) for any m and q. We also determine the second separating redundancy values of R(m,q) for any q and m=1 and 2. For m≥3, we set up a binary integer linear programming problem, the optimum of which gives a lower bound on the second separating redundancy of R(m,q).

Simulations are often deployed to evaluate proposed mechanisms or algorithms in Mobile Ad Hoc Networks (MANET). In MANET, the impacts of some simulation parameters are noticeable, such as transmission range, data rate etc. However, the effect of mobility model is not clear until recently. Random Waypoint (RWP) is one of the most applied nodal mobility models in many simulations due to its clear procedures and easy employments. However, it exhibits the two major problems: decaying average speed and border effect. Both problems will overestimate the performance of the employed protocols and applications. Although many recently proposed mobility models are able to reduce or eliminate the above-mentioned problems, the concept of Diverse Average Speed (DAS) has not been introduced. DAS aims to provide different average speeds within the same speed range. In most mobility models, the average speed is decided when the minimum and maximum speeds are set. In this paper, we propose a novel mobility model, named General Ripple Mobility Model (GRMM). GRMM targets to provide a uniform nodal spatial distribution and DAS without decaying average speed. The simulations and analytic results have demonstrated the merits of the outstanding properties of the GRMM model.

The Telecommunications Management Network (TMN) is a major focus of telecommunications operations work in the 1990s. New telecommunication equipment is required to conform to the TMN standards. In the TMN, a network element is managed as a set of Managed Objects (MOs). The MO program has to be executed in a muiltithreaded, parallel environment for a quick response; therefore, concurrency control is a key issue for developing an MO program. This paper proposes a formal definition to specify data for concurrency control to improve the correctness and reusability of the specification. The definition is based on a Generic Relationship Model (GRM). By using the formalized definition and developing an algorithm to translate the definition into executable code, concurrency control is performed without coding. After describing the algorithm used to perform concurrency control, this paper discusses a three-layer concurrency control architecture to accommodate this framework efficiently.