References
- M. El-Khamy, “The Average Weight Enumerator and the Maximum Likelihood Performance of Product Codes,” Int. Conf. Wireless Networks, Communications and Mobile Computing, Maui, Hawaii, USA, June 2005, pp. 1587-1592.
- S. Lin and D.J. Costello, Error Control Coding: Fundamentals and Applications, Englewood Cliffs, New Jersey: Prentice Hall, 1983.
- Y.M. Chee, C.J. Colbourn, and A.C. Ling, “Asymptotically Optimal Erasure-Resilient Codes for Large Disk Arrays,” Discrete Applied Mathematics, vol. 102, 2000, pp. 3-36. https://doi.org/10.1016/S0166-218X(99)00228-0
- K. Srinivasan and C. Colbourn, “Failed Disk Recovery in Double Erasure RAID Arrays,” Journal of Discrete Algorithms, vol. 5, no. 1, Mar. 2007, pp. 115-128. https://doi.org/10.1016/j.jda.2006.03.003
- E. Rosnes, “Stopping Set Analysis of Iterative Row-Column Decoding of Product Codes,” IEEE Trans. Information Theory, vol. 54, no. 4, Apr. 2008, pp. 1551-1560. https://doi.org/10.1109/TIT.2008.917686
- M.A. Kousa and A.H. Muqaibel, “Cell Loss Recovery Using Two-Dimensional Erasure Correction for ATM Networks,” Seventh Int. Conf. Telecommunication Systems, Mar. 1999, pp. 85-89.
- H.D. Hollmann and L.M. Tolhuizen, “Generic Erasure Correcting Sets: Bounds and Constructions,” Journal of Combinatorial Theory, vol. A113, no. 8, Nov. 2006, pp. 1746-1759.
- D.M. Rankin and T.A. Gulliver, “Single Parity Check Product Codes,” IEEE Trans. Communications, vol. 49, no. 8, Aug. 2001, pp. 1354-1362. https://doi.org/10.1109/26.939851
- M.A. Kousa, “A Novel Approach for Evaluating the Performance of SPC Product Codes under Erasure Decoding,” IEEE Trans. Communications, vol. 50, Jan. 2002, pp. 7-11. https://doi.org/10.1109/26.975732
- R. Amutha, K. Verraraghavan, and S. Srivatsa, “Recoverability Study of SPC Product Codes under Erasure Decoding,” Information Sciences, 2005, pp. 169-179.
- A. Al-Shaikhi and J. Ilow “Erasure Rate Analysis and Tighter Upper Bound for Binary Product Codes,” IEEE Communications Letters, vol. 10, no. 7, July 2006, pp. 546-548. https://doi.org/10.1109/LCOM.2006.224415
- A. Al-Shaikhi and J. Ilow, “Improved Upper Bound for Erasure Recovery in Binary Product Codes,” IEEE 16th Int. Symp. Personal, Indoor and Mobile Radio Communications (PIMRC), Berlin, Germany, vol. 2, Sept. 2005, pp. 1086-1090.
Cited by
- An approach to the performance of SPC product codes on the erasure channel vol.10, pp.1, 2009, https://doi.org/10.3934/amc.2016.10.11
- SPC product codes, graphs with cycles and Kostka numbers vol.113, pp.4, 2009, https://doi.org/10.1007/s13398-019-00698-1