In digital communication, convolutional codes are important to control the errors between the transmitter and receiver. Convolutional code is a type of error correction code (ECC) which can perform both error detection and correction operation between transmitter and receiver side. Here information bits are transformed serially through the architecture which is one of the major advantages as co...

This paper aims to verify the performance of a serially concatenated code proposed by Stephan ten Brink [1]. The code combines an outer rate one-half repetition code with an inner rate one convolutional code, separated by a permuter. The code is claimed to reach a bit error rate under 10 by 0.28 dB.

This research presents a robust video transmission scheme over fading wireless channels that relies on a coordinated protection e ort in handling channel and source variations dynamically. Given the priority of each source packet and the estimated channel condition, an adaptive protection scheme based on joint source-channel criteria is investigated via proactive forward error correction (FEC)....

The theory of error-correcting codes derived from curves in an algebraic geometry was initiated by the work of Goppa as generalizations of Bose-Chaudhuri-Hocquenghem (BCH), Reed–Solomon (RS), and Goppa codes. The development of the theory has received intense consideration since that time and the purpose of the paper is to review this work. Elements of the theory of algebraic curves, at a level...

The surface code scheme for quantum error correction holds great promise with relatively high error rate thresholds predicted some three orders of magnitude higher than conventional quantum error-correcting codes (such as the Steane code). The central problem is the question of how to physically implement the surface code in viable physical qubit systems. This report details the calculation of ...

For an error-correcting code and a distance bound, the list decoding problem is to compute all the codewords within the given distance to a received message. The bounded distance decoding problem, on the other hand, is to find one codeword if there exists one or more codewords within the given distance, or to output the empty set if there does not. Obviously the bounded distance decoding proble...