C. T. Retter, "Decoding binary expansions of low-rate Reed--Solomon codes far beyond the BCH bound," in Proc. 1995 IEEE Int. Symp. Information Theory, Whistler, B.C., Canada, Sept. 1995, p. 276. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Image Steganography For Hidden Communication - Marvel (1999) (2 citations) (Correct)
....in [60] correct this large number of errors. These codes were derived by expanding traditional Reed Solomon (RS) codes with symbol alphabet equal to Q = 2 j to j binary symbols. The selected codes have many low weight parity checks and are decoded using an iterative decoder developed by Retter [61]. The iterative decoder is based on an idea from 57 Bossert and Hergert [62] using low weight parity checks. These codes and decoder are capable of correcting many more bit errors than the traditional RS decoders. For instance, using the (255,4) RS code, whose minimum symbol distance is equal to ....
....but any pattern of errors that affected more than 125 symbols would be uncorrectable. The average binary minimum distance of the (2040,32) codes in [60] is 863.4, suggesting that about 431 binary errors are correctable with the appropriate binary decoder. However, the iterative decoders of [61] can correct virtually all error patterns with weights less than 700. Table 4.2 lists these powerful codes, BER capability, the possible SSIS payload in bpp and the information rate (information bits image bits) We select the code from this table that is capable of correcting the specific ....
C.T. Retter. Decoding binary expansions of low-rate Reed-Solomon codes far beyond the BCH bound. Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, page 276, Sep 1995. 100
Reliable Blind Information Hiding for Images - Marvel, Boncelet, Jr., Retter (1998) (7 citations) (Correct)
....is expected to be noisy, the appropriate low rate error correcting code can be selected to provide desired performance. Any error correcting code that is capable of correcting for the high signal estimation BER can be used within SSIS. For proof of concept, binary expansions of Reed Solomon codes [21] are used by SSIS for error correction. These codes can correct many binary errors if a decoder that corrects bits instead of Reed Solomon code symbols is used. The decoders described in [21] are based on a simple idea of Bossert and Hergert [22] if we have a large number of low weight parity ....
....estimation BER can be used within SSIS. For proof of concept, binary expansions of Reed Solomon codes [21] are used by SSIS for error correction. These codes can correct many binary errors if a decoder that corrects bits instead of Reed Solomon code symbols is used. The decoders described in [21] are based on a simple idea of Bossert and Hergert [22] if we have a large number of low weight parity checks, then the number of failing parity checks tends to be proportional to the number of errors. Using this idea, we can change whichever bits reduce the number of failing parity checks until ....
[Article contains additional citation context not shown here]
C.T. Retter. Decoding binary expansions of low-rate Reed-Solomon codes far beyond the BCH bound. Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, page 276, Sep 1995.
Spread Spectrum Image Steganography - Marvel, Boncelet, Jr., Retter (1999) (13 citations) Self-citation (Retter) (Correct)
No context found.
C. T. Retter, "Decoding binary expansions of low-rate Reed--Solomon codes far beyond the BCH bound," in Proc. 1995 IEEE Int. Symp. Information Theory, Whistler, B.C., Canada, Sept. 1995, p. 276.
Spread Spectrum Image Steganography - Marvel, Boncelet, Retter (1999) (13 citations) Self-citation (Retter) (Correct)
....process, we have incorporated the use of low rate error control codes to correct the large number of bit errors. Any error correcting code that is capable of correcting the high signal estimation BER can be used within SSIS. For SSIS proof of concept, binary expansions of Reed Solomon codes [24] with a decoder based on a simple idea of Bossert and Hergert [25] using low weight parity checks were used for error correction. This has now been extended to convolutional codes [26] using the Viterbi algorithm. The use of error correction by SSIS compensates for the suboptimal estimation of the ....
C.T. Retter. Decoding binary expansions of low-rate Reed-Solomon codes far beyond the BCH bound. Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, British Columbia, page 276, Sep 1995.
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