G. Clark, J.B. Cain, Error Correcting Coding for Digital Communications, Plenum Press, New York, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Woven Codes with Outer Warp: Variations, Design.. - Freudenberger.. (2001) (Correct)
....inner and outer generator matrices as given above and with a randomly chosen block interleaver we can only guarantee a minimum distance d TC 7. VI. DESIGNED INTERLEAVING T HE use of designed interleavers is motivated by the asymptotic coding gain, which for un quantized channels is given by [22]: G a = 10 log(Rd) 44) where R is the rate and d is the minimum distance of the code. This formula implies that for fixed rates the codes should be constructed with minimum distances as large as possible, in order to ensure efficient performance for high signal to noise ratios (SNR) In this ....
G. C. Clark and J. B. Cain, Error-correcting Coding for Digital Communications, Plenium Press, 1988, ISBN 0-306-40615-2.
Critical Noise for Convergence of Iterative.. - Fossorier, Mihaljevic, .. (1999) (Correct)
....achieves a good performance complexity trade off. Finally, several results related to the decoding procedures based on a posteriori probability (APP) threshold decoding [11] and the iterative principle presented in [3, pp. 152 153] have been reported. Essentially using the underlying ideas from [3, 6], a number of iterative error correction decoding algorithms have been developed and analyzed in [4, 8, 12, 14, 20] for example, noting that the algorithms in [4, 12, 14] are presented in crypto oriented forms. These APP based algorithms are simplier than, but not as efficient as the BP based ....
G. C. Clark, Jr. and J. B .Cain, Error-Correcting Coding for Digital Communications. New York: Plenum Press, 1982.
Wireless Video Transport Using Conditional Retransmission.. - Aramvith, Lin, Sun (2000) (1 citation) (Correct)
....errors, it will be requested for retransmission. From our proposed algorithm, we could save the encoder interleaver delay of nl R seconds. To save more delay, the convolutional interleaver can be used. The performance of a convolutional interleaver is very similar to that of a block interleaver [10]. No extra memoryis required in both cases since we combine the interleaving memory with the encoder buffer. Several parameters were chosen as follows: the interleaving memory size was set to X = 50 of the video encoder buffer size. Since in TMN8, the encoder buffer size is M = 3200 bits ....
Clark, G. C., Jr., and Cain, J. B., Error-Correcting Coding for Digital Communications, Plenum Press, New York, 1979.
Source-Channel Coding for CELP Speech Coders - Asenstorfer (1994) (Correct)
....threshold case. If three bits are used (7 thresholds) the performance improvement is of the order 2.25 dB. This allows operation further into the noise. The Golay code using the Chase algorithm (soft decision) was chosen as a candidate block code, for the unequal error protection. Clark and Cain [98] provide a good chapter (Chapt. 4) on soft decision decoding of block codes and also provide performance curves for soft decision decoding of the Golay and other codes. To test the idea of using unequal error protection and permutation of the indices certain assumptions were made. The (24,12) ....
G.C. Clark and J. Bibb Cain,Error Correcting Coding for Digital Communications, Chapt. 4, Plenum Press 1981.
Genetic Algorithms for Soft Decision Decoding of Linear .. - Maini, Mehrotra.. (1993) (2 citations) (Correct)
.... are binary antipodal over a discrete memoryless channel susceptible to additive white Gaussian noise, and the noise affects each symbol independently, then P(rjc 0 ) is maximized when the squared Euclidean distance between vector r and c 0 , P n j=1 (r j Gamma c 0 j ) 2 , is minimized (Clark Cain, 1988; Farrell, Rudolph Hartmann, 1983) Thus maximum likelihood decoding reduces to nearestneighbor decoding, with the Euclidean metric. More formally the soft decision decoding problem reduces to: Given received real vector r = r 1 ; r n ) find a codeword c 2 C that minimizes P n j=1 (r ....
Clark, G. C., & Cain, J. B. (1988). Error Correcting Coding for Digital Communications.
On Loss Probabilities In Presence Of Redundant.. - Ait-Hellal.. (1999) (Correct)
No context found.
G. Clark, J.B. Cain, Error Correcting Coding for Digital Communications, Plenum Press, New York, 1981.
On Loss Probabilities in Presence of Redundant.. - Hellal, Altman.. (1999) (2 citations) (Correct)
No context found.
G. Clark and J. B. Cain, Error correcting Coding for Digital Communications, Plenum Press, 1981.
Vectorial Fast Correlation Attacks - Golic, Morgari (2004) (Correct)
No context found.
G. C. Clark, Jr., and J. B. Cain, Error-Correcting Coding for Digital Communications, Plenum Press, New York, 1982.
Decreasing Loss Probabilities by Redundancy and.. - Jean-Marie, Dube.. (Correct)
No context found.
G. Clark and J. B. Cain, Error correcting Coding for Digital Communications, Plenium Press, 1988.
On the Complexity of Minimum Distance Decoding of Long.. - Barg, Krouk, van Tilborg (1999) (Correct)
No context found.
G. Clark and J. Cain, Error-Correcting Coding for Digital Communication. London, U.K.: Plenum, 1981.
Complexity Issues in Coding Theory - Barg (1997) (5 citations) (Correct)
No context found.
G. Clark and J. Cain, Error-Correcting Coding for Digital Communication, London: Plenum Press (1981).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC