A new high rate binary linear block code construction technique, named as Geometric Construction (GC) codes, was proposed recently [1]. It generates all the even full information rate (optimal) Hamming distance – 4 codes. In this paper, we have enhanced the construction of GC codes with respect to code rate and derived a code family of hamming distance-8 GC codes.

Emerging design problems are prompting the use of code motion and speculative execution in high-level synthesis to shorten schedules and meet tight timeconstraints. However, some code motions are not worth doing from a worst-case execution perspective. We propose a technique that selects the most promising code motions, thereby increasing the density of optimal solutions in the search space.

Consider a finite set of q elements and containing a distinguished element ”zero”. The choice of a set does not matter in our context and we will use the set Zq of integers modulo q. Let Z q be the set of n-tuples (or vectors) over Zq and Z n,w q be the set of n-tuples over Zq of Hamming weight w. A code is called constant-weight if all the codewords have the same weight w. A code is called equ...

This thesis explores error-correcting codes which can be used in physical unclonable function (PUF) applications. We investigate linear block codes and concatenated codes, which are traditionally used with PUFs, and compare them to convolutional codes using the criteria of error correction capability, decoder hardware requirements, flexibility of code parameters, and code rate. The application ...

This paper describes e cient and optimal encoding and representation of object contours. Contours are approximated by connected second-order spline segments, each de ned by three consecutive control points. The placement of the control points is done optimally in the rate-distortion (RD) sense and jointly with their entropy encoding. We utilize a di erential scheme for the rate and an additive ...

An effective grammar can be induced from natural language sentences by simultaneously minimizing the cost of encoding the grammar and the cost of encoding the corresponding derivations of the sentences. In previous work, the cost of encoding a derivation was computed in terms of the number of bits it requires to encode which of the possible productions is used to expand each of its non-terminal...

We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit p...

To remain useful for their users, software systems need to continuously enhance and extend their functionality. Nevertheless, in many object-oriented applications, features are not represented explicitly. The lack of modularization is known to make application features difficult to locate, to comprehend and to modify in isolation from one another. In our work, we implement restructuring using F...

Oliver R uthing Department of Computer Science University of Dortmund D-44221 Dortmund, Germany [email protected] Abstract Common algorithms for partial redundancy elimination that are sensitive to register pressure are designed from a single-expression point of view. For each computation under investigation unnecessary code motion is avoided as far as possible. Unfortunately, su...

Efficient layout of code and data sections in various types/levels of memory in an embedded systems is very critical not only for achieving real-time performance, but also for reducing its cost and power consumption. In this paper we formulate the optimal code and data section layout problem as an integer linear programming (ILP) problem. The proposed formulation can handle: (i) on-chip and off...