The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in the set of all permutations on n elements, Sn, using the Kendall’s τ -metric. We prove that there are no perfect single-error-correcting codes in Sn, where n...

This paper investigates the design of channel-optimized scalar quantizers with erasure correcting codes over binary symmetric channels (BSC). A new scalar quantizer with uniform decoder and channel-optimized encoder aided by erasure correcting code is proposed. The lower bound for performance of the new quantizer with complemented natural code (CNC) index assignment is given. Then, in order to ...

The present note is designing encoding and decoding algorithms for a forest of rooted uniform hypertrees and hypercycles in linear time, by using as little as n− 2 integers in the range [1, n]. This simple extension of the classical Prüfer code for rooted trees to an encoding for forests of rooted uniform hypertrees and hypercycles makes it possible to count them up, according to their number o...

We describe methods and software tools which aid in reverse-engineering COBOL application programs back to the specification stage (and in validating them against the specification). The aim is to create object-oriented abstractions from the implementation which capture the design concepts accurately, and the central process which the tools support is ‘transformation from formalism to formalism...

In the Internet of Things a code resolution service provides a discovery mechanism for a requester to obtain the information resources associated with a particular product code immediately. In large scale application scenarios a code resolution service faces some serious issues involving heterogeneity, big data and data ownership. A code resolution service network is required to address these i...

This paper introduces a class of linear codes which are non-uniform error correcting, i.e. they have the capability of correcting different errors in different codewords. A technique for specifying error characteristics in terms of algebraic inequalities, rather than the traditional spheres of radius e, is used. A construction is given for deriving these codes from known linear block codes. Thi...

We present a numerical study of beam transport through a FODO HEBT typical of proposed large current ion linear accelerator systems. Previous studies of this problem have usually assumed uniform and linear focusing forces. In contrast, our study includes non uniform focusing as well as nonlinearities associated with space charge forces, fringe fields and RF gaps. We examine current limits, beam...

Convolution surfaces generalize point-based implicit surfaces to incorporate higherdimensional skeletal elements, of which line segments can be considered the most fundamental since they can approximate curve skeletons. Existing analytical models for line-segment skeletons assumes uniform weight distributions and thus can only produce constant-radius convolution surfaces. This paper presents an...

A relatively simple model of the resistive wall mode RWM is derived for a large aspect ratio, low , circular cross section, tokamak plasma, surrounded by a concentric, thin, uniform resistive wall. The model employs uniform toroidal plasma rotation, and includes the following realistic edge dissipation mechanisms: dissipation due to charge-exchange with cold neutrals, and dissipation due to neo...

SUMMARY In this paper, a new large spreading code set with a uniform low cross-correlation is proposed. The proposed code set is capable of (1) increasing the number of assigned user (capacity) in a multicarrier code division multiple access (MC-CDMA) system and (2) reducing the peak-to-average power ratio (PAPR) of an orthogonal frequency division multiplexing (OFDM) system. In this paper, we ...