Open AccessBook
Error Control Systems for Digital Communication and Storage
Reads0
Chats0
TLDR
This work has shown that polynomials over Galois Fields, particularly the Hadamard, Quadratic Residue, and Golay Codes, are good candidates for Error Control Coding for Digital Communication Systems.Abstract:
1. Error Control Coding for Digital Communication Systems. 2. Galois Fields. 3. Polynomials over Galois Fields. 4. Linear Block Codes. 5. Cyclic Codes. 6. Hadamard, Quadratic Residue, and Golay Codes. 7. Reed-Muller Codes 8. BCH and Reed-Solomon Codes. 9. Decoding BCH and Reed-Solomon Codes. 10. The Analysis of the Performance of Block Codes. 11. Convolutional Codes. 12. The Viterbi Decoding Algorithm. 13. The Sequential Decoding Algorithms. 14. Trellis Coded Modulation. 15. Error Control for Channels with Feedback. 16. Applications. Appendices: A. Binary Primitive Polynomials. B. Add-on Tables and Vector Space Representations for GF(8) Through GF(1024). C. Cyclotronic Cosets Modulo 2m-1. D. Minimal Polynomials for Elements in GF (2m). E. Generator Polynomials of Binary BCH Codes of Lengths Through 511. Bibliography.read more
Citations
More filters
Journal ArticleDOI
Toward a unified framework for modeling and analysis of diversity in joint source - channel coding
Andres Kwasinski,K.J.R. Liu +1 more
TL;DR: For certain multimedia systems using practical source and channel codes in a JSCC bit rate allocation design, the D-SNR curve is shown to be well approximated by a set of carefully selected points where the relative contribution of channel errors to end-to-end distortion is small.
Proceedings ArticleDOI
Variable-rate punctured convolutional coding over fading mobile communication channels
A. Abou-El-Azm,F.S. Mohammed +1 more
TL;DR: A computer simulation model of a digital mobile communication system using variable-rate convolutional coding and rate Compatible Punctured Convolutional codes (RCPC codes) are used to provide the rate variation.
Journal ArticleDOI
Hashing via finite field
TL;DR: A new and efficient open addressing technique, called hashing via finite field, is proposed to construct a new class of hash functions with table size m=p^n, where p is prime and n>=1, and it is clear that it includes prime m as a special case when n=1.
Proceedings ArticleDOI
RF Energy Harvesting in Wireless Networks with HARQ
TL;DR: This paper targets the optimal time switching policy in order to maximize the probability of successful decoding within a fixed number of re- transmissions, in the absence of CSI information at the receiver, and introduces a heuristic TS policy which is shown to have a performance superior to the greedy policy and close to that of the lower bound.
Journal ArticleDOI
Error concealment via particle filter by Gaussian mixture modeling of motion vectors for H.264/AVC
Ali Radmehr,Abdorasoul Ghasemi +1 more
TL;DR: Experimental results are provided to show the efficiency of this filtering approach compared to a recent scheme based on Kalman filtering, and meaningful increase in the quality of the recovered video sequences in terms of PSNR up to 3 dB compared with the other error concealment techniques.