| Abstrakt: |
Data transmission without any error defines the reliability and the accuracy of the data. Transmitted data is bound to get corrupted with noise in the channel and is inevitable. The channel is treated to various types of noises like random noise or burst noise. During transmission, this noise is introduced in the channel and the data is degraded, which is our concern. The errors may occur randomly or in bursts, leading to warping of the data. Channel coding enables the transmitted signal to withstand the noise effects and improve the performance. In the process, the reliability of the data is sure to improve. Channel coding introduces redundancy in the data. In fact, this addition of data in a structured form is making it possible to detect and correct errors. To ensure the authenticity of the data, the price to be paid is the data overhead. Error correction coding is the design of channel encoder and decoder. Automatic Repeat Request (ARQ) and Forward Error Correction (FEC) are the two different methods of error controlling. Retransmission of the block is done if an error is detected in ARQ, whereas in FEC, received error rate is controlled via forward transmission only. Coding for block codes is a FEC scheme of error control. An (n, k) linear block code with a specified parity bit structure expresses a block of 'k' message bits in a block of 'n' coded bits. In systematic linear block code, 'k' information bits are followed by 'n - k = r' parity bits forming an 'n' bit code word. In this paper, a binary channel coding scheme by name "data negation codes" is proposed, which can be used for single/multiple random error correction and in a modified form, can be used for burst error correction also. Also, the performance of data negation codes is described in terms of probability of undetected errors and Bit Error Rate (BER). [ABSTRACT FROM AUTHOR] |
