A new class of nested linear block code is introduced. The codes of this class, referred to as nested codes. cover a wide range of code length and rates. The parity check matrix of a nested code is constructed from tw...
详细信息
A new class of nested linear block code is introduced. The codes of this class, referred to as nested codes. cover a wide range of code length and rates. The parity check matrix of a nested code is constructed from two other linear block codes. Although the rates of the resulting codes are not optimal. the codes nevertheless exhibit some useful properties: in particular. they have a well-defined mathematical structure. which leads to a fast and simple decoding algorithm.
In a fingerprinting scheme, marks are embedded in a digital object to protect intellectual property. Dishonest users can collude, change some of the marks and create a new copy. In this case codes with the 'identi...
详细信息
In a fingerprinting scheme, marks are embedded in a digital object to protect intellectual property. Dishonest users can collude, change some of the marks and create a new copy. In this case codes with the 'identifiable parent property' or IPP codes [4], provide means of traceability. Here, both a new decoding algorithm for IPP codes and an improvement of earlier algorithms are presented.
Conventional geometric Goppa codes are defined in terms of functions of an algebraic function field associated with a divisor evaluated in places of degree 1. The generalization that will be treated here allows evalua...
详细信息
Conventional geometric Goppa codes are defined in terms of functions of an algebraic function field associated with a divisor evaluated in places of degree 1. The generalization that will be treated here allows evaluations in places of arbitrary degree. With the appropriate inner product, the dual of the code can be defined and described in terms of Weil differentials similarly to conventional geometric Goppa codes. A decoding algorithm is derived.
This work presents a fast maximum a posteriori (MAP) decoding algorithm based on a modified BGT algorithm [1]. Since the probability function of the proposed algorithm has been simplified, the computa
This work presents a fast maximum a posteriori (MAP) decoding algorithm based on a modified BGT algorithm [1]. Since the probability function of the proposed algorithm has been simplified, the computa
To reduce the memory size and speed up the process of searching for a symbol in a Huffman tree, we propose a memory-efficient array data structure to represent the Huffman tree. Then, we present a fast Huffman decodin...
详细信息
To reduce the memory size and speed up the process of searching for a symbol in a Huffman tree, we propose a memory-efficient array data structure to represent the Huffman tree. Then, we present a fast Huffman decoding algorithm, which takes O(log n) time and uses [3n/2] + [n/2 log n] + 1 memory space, where it is the number of symbols in a Huffman tree. (C) 1999 Elsevier Science B.V. All rights reserved.
decoding concatenated codes with an iterative decoder including a stopping criterion saves power compared to decoding with a tired number of iterations. In this work the throughput of the decoder is also increased. Th...
详细信息
decoding concatenated codes with an iterative decoder including a stopping criterion saves power compared to decoding with a tired number of iterations. In this work the throughput of the decoder is also increased. This is achieved by using additional buffers at the decoder input and a modified stepping criterion. Simulations demonstrate that this method can double the throughput compared to the conventional decoding algorithm.
A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n - k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existi...
详细信息
A new decoding algorithm for burst-error-correction is proposed. The proposed algorithm can effectively correct burst errors of length approaching n - k symbols for (n, k) Reed-Solomon (RS) codes. Compared with existing algorithms, the algorithm enables much faster decoding with far less computational complexity.
We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes. The encoding is adaptable in that each bit to be encoded may have an associated ...
详细信息
ISBN:
(纸本)0769510310
We present a novel entropy coding technique which is based on recursive interleaving of variable-to-variable length binary source codes. The encoding is adaptable in that each bit to be encoded may have an associated probability estimate which depends on previously encoded bits. The technique may have advantages over arithmetic coding. The technique can achieve arbitrarily small redundancy, and admits a simple and fast decoder. We discuss code design and performance estimation methods, as well as practical encoding and decoding algorithms.
The finite Toda molecule over finite fields is introduced whose dynamics are completely classified by conserved quantities. The trajectories blow up in a finite time or are periodic. A BCH-Goppa decoding algorithm is ...
详细信息
The finite Toda molecule over finite fields is introduced whose dynamics are completely classified by conserved quantities. The trajectories blow up in a finite time or are periodic. A BCH-Goppa decoding algorithm is designed. The number of Toda particles is congruent with the maximal number of errors to be decoded. (C) 1998 Elsevier Science B.V.
We propose a novel soft-decision decoding algorithm for cyclic codes based on energy minimization principle. The well-known soft-decision decoding algorithms for block codes perform algebraic (hard-decision) decoding ...
详细信息
We propose a novel soft-decision decoding algorithm for cyclic codes based on energy minimization principle. The well-known soft-decision decoding algorithms for block codes perform algebraic (hard-decision) decoding several times in order to generate candidate codewords using the reliability of received symbols. In contrast, the proposed method defines energy as the Euclidean distance between the received signal and a codeword and alters the values of information symbols so as to decrease the energy in order to seek the codeword of minimum energy, which is the most likely codeword. We let initial positions be the information parts of signals obtained by cyclically shifting a received signal and look for the point, which represents a codeword, of minimum energy by moving each point from several initial positions. This paper presents and investigates reducing complexity of the soft-decision decoding algorithm. We rank initial positions in order of reliability and reduce the number of initial positions in decoding. Computer simulation results show that this method reduces decoding complexity.
暂无评论