Results 81 to 90 of about 210 (96)
Some of the next articles are maybe not open access.
On decoding concatenated codes
IEEE Transactions on Information Theory, 1990The 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.
Wayne E. Stark, A.A. Hassan
openaire +2 more sources
Concatenated space-time coding
12th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications. PIMRC 2001. Proceedings (Cat. No.01TH8598), 2002The serial concatenation of standard convolutional codes with differential space-time modulation is considered for fast flat fading multiple antenna channels. Decoding is performed iteratively by passing symbol-wise a-posteriori probability information between the decoders of the inner space-time code and the outer convolutional code.
Alex Grant, Christian Schlegel
openaire +5 more sources
Soft information in concatenated codes
IEEE Transactions on Communications, 1996A new soft decision criterion is derived. This is useful in communication systems where the combination of modulation, interleaving, and error correction is used. The new algorithm is attractive to implement since traceback techniques can be used and only a little extra memory is required to obtain the soft information associated with every symbol ...
O. Trandem, T. Maseng, B. Rislow
openaire +3 more sources
A concatenated coding system with 3 codes [PDF]
Proceedings of 1994 IEEE International Symposium on Information Theory, 2002 A concatenated coding scheme with 3 codes is studied. A product code is used for the outer code, and the super channel including the inner code with Viterbi decoding is supposed bursty. An array decoding procedure for the outer code that incorporates error detection and erasure decoding is presented, and the performance evaluated is favorably compared ...
Ph. Sehier, J. Fang
openaire +1 more source
Concatenated group codes and their exponents
IEEE Transactions on Information Theory, 1987Codes that are concatenations of group codes are considered. It is shown that when G and H are finite groups and the inner and outer codes are G- and H- codes, respectively, then under certain conditions the concatenated code is a G \times H code. A necessary and sufficient condition is given for a G \times H code to have a structure as a concatenated ...
openaire +3 more sources
Zigzag codes and concatenated zigzag codes
IEEE Transactions on Information Theory, 2001This 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.
Li Ping, Xiaoling Huang, N. Phamdo
openaire +2 more sources
Concatenated convolutional codes with interleavers
IEEE Communications Magazine, 2003This article presents a tutorial overview of the class of concatenated convolutional codes with interleavers, also known as turbo-like codes. They are powerful codes, formed by a number of encoders connected through interleavers, endowed by a decoding algorithm that splits the decoding burden into separate decoding of each individual code.
BENEDETTO, Sergio +2 more
openaire +2 more sources
On generalised concatenated codes
1997The 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 +3 more sources
Concatenated hash code selection
International Journal of Computer & Information Sciences, 1984An 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 bound ...
Shi-Kuo Chang, J. C. Dorng
openaire +2 more sources
Zigzag codes and concatenated zigzag codes
1999 Information Theory and Networking Workshop (Cat. No.99EX371), 2003This 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