« PreviousContinue »
(12) United States Patent ao) Patent No.: us 6,757,122 Bi
Kuznetsov et al. (45) Date of Patent: Jun. 29,2004
Y. Kou, S. Lin, and M. Fossorier, "Low-Density ParityCheck Codes Based on Finite Geometries: A Rediscovery and New Results," IEEE Transactions on Information Theory, vol. 47, No. 7, pp. 2711-2736, Nov. 2001.
R. G. Gallager, "Low-Density Parity-Check Codes," Cambridge, Massachusetts, MIT Press, Jul. 1963.
B. Vasic, "Structured Iteratively Decodable Codes Based on Steiner Systems and Their Application in Magnetic Recording," Globecom 2001, San Antonio, Texas, Nov. 2001.
J. Hagenauer and P. Hoeher, "A Viterbi Alorithm with Soft-Decision Outputs and its Applications," Dallas GLOBECOM '89, pp. 1680-1686, Nov. 27-30, 1989.
L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Transactions on Information Theory, vol. IT-20, No. 2, pp. 284-287, Mar. 1974.
J. L. Fan, A. Friedmann, E. Kurtas, and S. McLaughlin, "Low Density Parity Check Codes for Magnetic Recoding," Thrity-seventh Annual Allerton Conference on Communication, Control and Computing, Monticello, Illinois, pp. 1314-1323, Sep. 22-24, 1999.
(List continued on next page.)
D. J. C. MacKay, "Good Error-Correcting Codes Based on
Very Sparse Matrices," IEEE Transactions on Information
Theory, vol. 45, No. 2, pp. 399^131, Mar. 1999.
T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of
Provably Good Low-Density Parity Check Codes," 2000
IEEE International Symposium on Information Theory, pp.
199, Jun. 25-30, 2000.
R. M. Tanner, "Recursive Approach to Low Complexity
Codes," IEEE Transactions on Information Theory, vol.
IT-27, No. 5, pp. 533-547, Sep. 1981.
Fan, J. L. "Constrained Coding and Soft Iterative Decoding", Proceedings of the IEEE Information Theory Workshop 2001, Sep. 2, 2001, pp. 18-20.
Soljanin, E. "Simple Soft-Output Detection for magnetic Recording Channels", Proceedings of the 2000 IEEE International Symposium on Information Theory ISIT 2000, Sorrento, Italy, Jun. 25-30, 2000, IEEE International Symposium on Information Theory, New York, NY, Jun. 25, 2000, p. 257.
* cited by examiner