[1] Altay, G.; Ucan, O.N.: Heuristic
construction of high-rate linear block
codes. Int. J. Electron. Commun. (AEÜ),
vol.60, pp.663-666, 2006.
[2] Bossert, M.: Channel Coding, Wiley,
1999.
[3] Williams, M.F.J.; Sloane, N.J.A.: The
Theory of Error-Correcting Codes.
(North-Holland, Amsterdam, 1998.
[4] 4. Forney, Jr., G.D.: Coset codes II:
Binary lattices and related codes. IEEE
Trans. Inform. Theory, 1988, 34, pp.
1152-1187.
[5] R. M. Pyndiah.: Near-optimum decoding
of product codes: Block turbo codes.
IEEE Trans. Commun., vol.46, No. 8,
pp.1003-1010, Aug. 1998.
[6] Peng, X.-H.; Farrell, P.G.: Optimal
augmentation of product codes.
Electronics Letters, 2004, 40, pp. 750-
752.
[7] Salomon, A.J.; Amrani, O.: Augmented
product codes and lattices: Reed-Muller
codes and Barnes-Wall lattices. Trans.
Inform. Theory, November 2005, vol.51,
No. 11, pp. 1152-1187.
[8] Brouwer, A. E.; Verhoeff, T.: An updated
table of minimum-distance bounds for
binary linear codes. IEEE Trans. Inform.
Theory, vol. 39, No. 2, pp. 664-677,
March 1993.
[9] Lucas, R.; Fossorier, M.P.C.; Kou, Y.;
Lin, S.: Iterative decoding of one-step
majority logic decodable codes based on
belief propagation. IEEE Trans.
Commun., vol.48, pp.931-937, June 2000.
[10] Jhonson, S. J.; Weller, S.R.: A family of
irregular LDPC codes with low encoding
complexity. IEEE Comm. Letter, vol. 7,
pp.79-81, No. 2, Feb. 2003.
Thank you for copying data from http://www.arastirmax.com
