scispace - formally typeset

Topic

Error detection and correction

About: Error detection and correction is a(n) research topic. Over the lifetime, 29440 publication(s) have been published within this topic receiving 409341 citation(s). The topic is also known as: error detection & error correction.


Papers
More filters
Journal ArticleDOI
TL;DR: A new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving appears to be close to the theoretical limit predicted by Shannon.
Abstract: This paper presents a new family of convolutional codes, nicknamed turbo-codes, built from a particular concatenation of two recursive systematic codes, linked together by nonuniform interleaving. Decoding calls on iterative processing in which each component decoder takes advantage of the work of the other at the previous step, with the aid of the original concept of extrinsic information. For sufficiently large interleaving sizes, the correcting performance of turbo-codes, investigated by simulation, appears to be close to the theoretical limit predicted by Shannon.

2,934 citations

Book
01 Jan 1983
TL;DR: To understand the theoretical framework upon which error-control codes are built and then Algebraic Codes for Data Transmission by Richard E. Blahut, needed, several examples to illustrate the performance of the approximation scheme in practice are needed.
Abstract: To understand the theoretical framework upon which error-control codes are built and then Algebraic Codes for Data Transmission By Richard E. Blahut. Hamid Jafarkhani, “Space-Time Coding: Theory and Practice”, Cambridge. Textbook, Richard E. Blahut, Algebraic Codes for Data Transmission. Bibliography Peter Sweeney, Error Control Coding: From Theory to Practice Juergen. 2Automatic Control Laboratory, ETH Zurich, Switzerland several examples to illustrate the performance of the approximation scheme in practice. Information theory says that there exists operational quantities called channel (9) Richard E. Blahut, “Computation of channel capacity and rate-distortion functions,” IEEE.

1,971 citations

Journal ArticleDOI
Abstract: The concept of punctured convolutional codes is extended by punctuating a low-rate 1/N code periodically with period P to obtain a family of codes with rate P/(P+l), where l can be varied between 1 and (N-1)P. A rate-compatibility restriction on the puncturing tables ensures that all code bits of high rate codes are used by the lower-rate codes. This allows transmission of incremental redundancy in ARQ/FEC (automatic repeat request/forward error correction) schemes and continuous rate variation to change from low to high error protection within a data frame. Families of RCPC codes with rates between 8/9 and 1/4 are given for memories M from 3 to 6 (8 to 64 trellis states) together with the relevant distance spectra. These codes are almost as good as the best known general convolutional codes of the respective rates. It is shown that the same Viterbi decoder can be used for all RCPC codes of the same M. the application of RCPC codes to hybrid ARQ/FEC schemes is discussed for Gaussian and Rayleigh fading channels using channel-state information to optimise throughput. >

1,955 citations

Journal ArticleDOI
TL;DR: A practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security and is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.
Abstract: This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of fading is characterized in terms of average secure communication rates and outage probability. Based on the insights from this analysis, a practical secure communication protocol is developed, which uses a four-step procedure to ensure wireless information-theoretic security: (i) common randomness via opportunistic transmission, (ii) message reconciliation, (iii) common key generation via privacy amplification, and (iv) message protection with a secret key. A reconciliation procedure based on multilevel coding and optimized low-density parity-check (LDPC) codes is introduced, which allows to achieve communication rates close to the fundamental security limits in several relevant instances. Finally, a set of metrics for assessing average secure key generation rates is established, and it is shown that the protocol is effective in secure key renewal-even in the presence of imperfect channel state information.

1,676 citations


Network Information
Related Topics (5)
Wireless

133.4K papers, 1.9M citations

85% related
Network packet

159.7K papers, 2.2M citations

84% related
Software

130.5K papers, 2M citations

83% related
Artificial neural network

207K papers, 4.5M citations

83% related
Wireless sensor network

142K papers, 2.4M citations

83% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20229
2021607
2020947
20191,040
2018997
2017899