论文信息 - A block-decodable (1,8) runlength-limited rate 8/12 code

A block-decodable (1,8) runlength-limited rate 8/12 code

Describes a (d,k)=(1,8) runlength-limited (RLL) rate 8/12 code with fixed codeword length 12. The code is block-decodable; a codeword can be decoded without knowledge of preceding or succeeding codewords. The code belongs to the class of bounded delay block-decodable (BDB) codes with one symbol (8 bits) look-ahead. Due to its format, this code is particularly attractive for use in combination with error-correcting codes such as Reed-Solomon codes over the finite field GF(2/sup 8/). >

H.D.L. Hollman

[1] Kornelis Antonie Immink. Block-Decodable Runlength-Limited Codes via Look-Ahead Technique , 1993, Proceedings. IEEE International Symposium on Information Theory.

[2] Brian L. Hughes,et al. On the error probability of signals in additive white Gaussian noise , 1991, IEEE Trans. Inf. Theory.

[3] H. Herzberg,et al. Techniques of bounding the probability of decoding error for block coded modulation structures , 1994, IEEE Trans. Inf. Theory.

[4] Imre Csiszár,et al. Graph decomposition: A new key to coding theorems , 1981, IEEE Trans. Inf. Theory.

[5] Alexander Barg,et al. On computing the weight spectrum of cyclic codes , 1992, IEEE Trans. Inf. Theory.

[6] C. Shannon. Probability of error for optimal codes in a Gaussian channel , 1959 .

[7] Rolf Johannesson,et al. A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes , 1984, IEEE Trans. Inf. Theory.

[8] Brian H. Marcus,et al. Bounds on the number of states in encoder graphs for input-constrained channels , 1991, IEEE Trans. Inf. Theory.

[9] E.R. Berlekamp,et al. The technology of error-correcting codes , 1980, Proceedings of the IEEE.

[10] Abraham Lempel,et al. Look-ahead coding for input- restricted channels , 1982, IEEE Trans. Inf. Theory.

[11] Peter A. Franaszek. Construction of Bounded Delay Codes for Discrete Noiseless Channels , 1982, IBM J. Res. Dev..