Results 191 to 200 of about 54,560 (207)

Zigzag codes and concatenated zigzag codes

IEEE Transactions on Information Theory, 2001
Summary: This paper introduces a family of error-correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low-complexity soft-in/soft-out decoding rules can be implemented.
Ping, Li, Huang, Xiaoling, Phamdo, Nam
openaire   +2 more sources

Concatenated hash code selection

International Journal of Computer & Information Sciences, 1984
Summary: An algorithm for selecting the concatenated hash code for partial-match or multiple-attribute retrieval in a hashing scheme is presented. The optimal code length for each attribute is determined with respect to a merit function. Two adjustment algorithms are then presented to find the optimal code length under the integer and nonnegative lower
Chang, S. K., Dorng, J. C.
openaire   +2 more sources

Partially concatenated convolutional codes

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
We present a new code construction called partially concatenated convolutional codes. Parallel concatenated convolutional codes (turbo codes) and serially concatenated convolutional codes can be regarded as special cases of this construction. However, proper partitioning of the outer code sequences provides a new degree of freedom for code design.
J. Freudenberger, M. Bossert, V. Zybablov, S. Shavgulidze   +3 more
openaire   +1 more source

Superimposed concatenated codes (Corresp.)

IEEE Transactions on Information Theory, 1980
A family of codes of length n=q^{s+l} over GF( q ), with 2s \leq q are presented which are constructed by superimposing concatenated codes on a concatenated code. The rate r and the distance ratio \delta of the new codes satisfy the relation r=1-\delta+\delta \ln (\delta) for sufficiently large values of n and q/s .
Y. Sugiyama, M. Kasahara, S. Hirasawa, T. Namekawa   +3 more
openaire   +1 more source

Reverse concatenated watermark codes

2012 IEEE International Conference on Communications (ICC), 2012
In this paper, we introduce an error correction coding scheme, known as reverse concatenated watermark codes for substitution, insertion and deletion channel. This code is obtained by concatenating a distribution transformer with an LDPC code.
Rathnakumar Radhakrishnan, Cai Kui
openaire   +1 more source

On decoding concatenated codes

IEEE Transactions on Information Theory, 1990
The correcting properties of concatenated codes with parallel decoding over an additive channel are investigated. The ith inner decoder's output is a codeword if the Euclidean distance between the received vector and some codeword is less than Delta /sub i/ and an erasure otherwise. The outer decoders correct errors and erasures.
A.A. Hassan, W.E. Stark
openaire   +1 more source

Partially Concatenated Convolutional Codes

IEEE Transactions on Communications, 2004
We present a new concatenated code construction. The resulting codes can be viewed as intermediate between parallel and serially concatenated convolutional codes. Proper partitioning of the outer code sequence provides a new degree of freedom for code design. Various methods are considered to analyze code properties.
J. Freudenberger, M. Bossert, S. Shavgulidze   +2 more
openaire   +1 more source

Zigzag codes and concatenated zigzag codes

1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
This paper introduces a family of error-correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low-complexity soft-in, soft-out decoding rules can be implemented.
null Li Ping, N. Phamdo
openaire   +1 more source

Concatenated Coding Systems and Turbo Codes

1999
As discussed in Chapter 1, one of the goals of coding research is to find a class of codes and associated decoders such that the probability of error could be made to decrease exponentially at all rates less than channel capacity while the decoding complexity increased only algebraically.
Irving S. Reed, Xuemin Chen
openaire   +1 more source

On generalised concatenated codes

1997
The Authors investigate a novel application of generalised concatenated coding theory to the E.S.A. Coding standard. The proposed coding and decoding system is compared to the E.S.A. coding standard, with both systems having the same coding rate. A number of RS codes are used in the system, each capable of correcting a different number of errors.
Sonander, Sean, Honary, Bahram
openaire   +1 more source