Results 221 to 230 of about 2,451,117 (239)
Some of the next articles are maybe not open access.

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.
N. Phamdo, Li Ping
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.
Martin Bossert   +3 more
openaire   +2 more sources

Cyclic concatenated codes with constacyclic outer codes

IEEE Transactions on Information Theory, 1992
Summary: The known construction of cyclic concatenated codes is based on the fact that the inner code is a cyclic minimal code, the outer code is cyclic, and the lengths of the inner and outer codes are relatively prime. Here, it is shown that if the outer code is a suitably chosen constacyclic code the overall concatenated code is always cyclic ...
openaire   +3 more sources

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.
Xuemin Chen, Irving S. Reed
openaire   +2 more sources

On BEP of a generalised concatenated coding

1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003
This paper is mainly concerned with the combination and decomposition of linear block error-control codes for satellite and deep space communications. These problems are posed because concatenated codes are not optimum codes in most cases. Even when the inner and outer codes are optimum codes individually, their combination is still not optimum.
openaire   +2 more sources

A merged BP decoding algorithm for polar-LDPC concatenated codes

International Conference on Digital Signal Processing, 2017
Jiaai Liu   +3 more
semanticscholar   +1 more source

A Soft Input Decoding Algorithm for Generalized Concatenated Codes

IEEE Transactions on Communications, 2016
Jens Spinner   +2 more
semanticscholar   +1 more source

Construction of High-Rate Generalized Concatenated Codes for Applications in Non-Volatile Flash Memories

International Memory Workshop, 2016
Jens Spinner   +2 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy