In this letter, we present a linear-complexity encoding algorithm for any cycle GF(2(p)) code C-E(G, H). We just need to investigate the case where G is a nontrivial connected graph. If G is a tree, the only codeword ...
详细信息
In this letter, we present a linear-complexity encoding algorithm for any cycle GF(2(p)) code C-E(G, H). We just need to investigate the case where G is a nontrivial connected graph. If G is a tree, the only codeword is the all-zero word. If G is not a tree, first, we show that through graph analysis H can he transformed into an equivalent block-diagonal upper-triangular form simply by permuting the rows and columns of H;then, we show that whether H is full row-rank or not, the code can be encoded in linear time.
We give lower bounds of the capacities of 2-dimensional Run-Length-Limited (RLL) constraints. We also present a coding algorithm for encoding data sequences into two-dimensional binary arrays satisfying a (1, 2)-RLL c...
详细信息
ISBN:
(纸本)0780382803
We give lower bounds of the capacities of 2-dimensional Run-Length-Limited (RLL) constraints. We also present a coding algorithm for encoding data sequences into two-dimensional binary arrays satisfying a (1, 2)-RLL constraint along both horizontal and vertical directions.
In this paper a software environment, called DAGC, is described. The main idea behind the design of DAGC is to facilitate research works in design and development of genetic clustering algorithms for automatic remodul...
详细信息
ISBN:
(纸本)3540221158
In this paper a software environment, called DAGC, is described. The main idea behind the design of DAGC is to facilitate research works in design and development of genetic clustering algorithms for automatic remodularization of software systems. Within the DAGC environment, clustering algorithms may be assembled or modified by simply selecting the parts from an extendable list of components. Using this distinguishing feature of the DAGC framework, a new algorithm with a new encoding and crossover operator was evolved.
The videophone service has been a dream for a long time, but there have been several reasons that prevented the service from becoming a reality. These are 1) the available data transmission bit rates were not high eno...
详细信息
The videophone service has been a dream for a long time, but there have been several reasons that prevented the service from becoming a reality. These are 1) the available data transmission bit rates were not high enough, 2) there were no encoding algorithms suitable for error prone transmission environments, and 3) the signal processing power of LSIs was too low. However, with the start of third-generation mobile communication services and the development of relevant technologies, such obstacles have almost disappeared and products with videophone capability are already on the market. This paper describes a visual signal encoding algorithm that Fujitsu has developed for the MPEG-4 system and describes its effectiveness under error free and error prone conditions. On average, our algorithm showed a 1 dB higher picture quality and an 18% smoother motion compared to the simple MPEG-4. The new algorithm is called the reduced resolution method.
We present an encoding algorithm-for lattices that significantly reduces space requirements while allowing fast computations of least upper bounds and greatest lower bounds of pairs of elements. We analyze the algorit...
详细信息
We present an encoding algorithm-for lattices that significantly reduces space requirements while allowing fast computations of least upper bounds and greatest lower bounds of pairs of elements. We analyze the algorithms for encoding, LUB and GLB computations, and prove their correctness. Empirical experiments reveal that our method is significantly more space efficient than the transitive closure method, and the saving becomes increasingly more important as the size of the lattice increases.
暂无评论