메뉴 건너뛰기




Volumn , Issue , 2010, Pages

A survey of Reed-Muller codes from polar coding perspective

Author keywords

Channel polarization; Polar codes; Reed Muller codes

Indexed keywords

POLAR CODES; RECURSIVE DECODING; REED-MULLER; REED-MULLER CODES; RM CODES;

EID: 77954825306     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITWKSPS.2010.5503223     Document Type: Conference Paper
Times cited : (52)

References (39)
  • 1
    • 0002669842 scopus 로고
    • Application of Boolean algebra to switching circuit design and to error correction
    • Sept.
    • D. E. Muller, "Application of Boolean algebra to switching circuit design and to error correction," IRE Trans. Electronic Computers, vol. EC-3, pp. 6-12, Sept. 1954.
    • (1954) IRE Trans. Electronic Computers , vol.EC-3 , pp. 6-12
    • Muller, D.E.1
  • 2
    • 0002855016 scopus 로고
    • A class of multiple-error-correcting codes and the decoding scheme
    • Sept.
    • I. Reed, "A class of multiple-error-correcting codes and the decoding scheme," IRE Trans. lnform. Theory, vol. 4, pp. 39-44, Sept. 1954.
    • (1954) IRE Trans. Lnform. Theory , vol.4 , pp. 39-44
    • Reed, I.1
  • 3
    • 33749932775 scopus 로고
    • Binary codes with specified minimum distance
    • Sept.
    • M. Plotkin, "Binary codes with specified minimum distance," IRE Trans. Inform. Theory, vol. 6, pp. 445-450, Sept. 1960.
    • (1960) IRE Trans. Inform. Theory , vol.6 , pp. 445-450
    • Plotkin, M.1
  • 5
    • 67650099990 scopus 로고    scopus 로고
    • Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
    • July
    • E. Arikan, "Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels," IEEE Trans. Inform. Theory, vol. 55, pp. 3051-3073, July 2009.
    • (2009) IEEE Trans. Inform. Theory , vol.55 , pp. 3051-3073
    • Arikan, E.1
  • 6
    • 77954828043 scopus 로고
    • US Patent 3537103: Serial Digital Decoder, Oct.
    • R. R. Green, "US Patent 3537103: Serial Digital Decoder," Oct. 1970.
    • (1970)
    • Green, R.R.1
  • 8
    • 4043113566 scopus 로고    scopus 로고
    • Simple MAP decoding of first-order Reed-Muller and Hamming codes
    • Aug.
    • A. Ashikhmin and S. Litsyn, "Simple MAP decoding of first-order Reed-Muller and Hamming codes," IEEE Trans. lnform. Theory, vol. 50, pp. 1812-1818, Aug. 2004.
    • (2004) IEEE Trans. Lnform. Theory , vol.50 , pp. 1812-1818
    • Ashikhmin, A.1    Litsyn, S.2
  • 9
    • 84941860379 scopus 로고
    • Coset codes-Part II: Binary lattices and related codes
    • Sept.
    • G. D. Forney Jr., "Coset codes-Part II: Binary lattices and related codes," IEEE Trans. Inform. Theory, vol. IT-34, pp. 1152-1187, Sept. 1988.
    • (1988) IEEE Trans. Inform. Theory , vol.IT-34 , pp. 1152-1187
    • Forney Jr., G.D.1
  • 10
    • 0029409023 scopus 로고
    • On bit-level trellis complexity of Reed-Muller codes
    • Nov
    • C.-C. Lu and S.-H. Huang, "On bit-level trellis complexity of Reed-Muller codes," IEEE Trans. Inform. Theory, vol. 41, pp. 2061-2064, Nov 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.41 , pp. 2061-2064
    • Lu, C.-C.1    Huang, S.-H.2
  • 13
    • 64149093297 scopus 로고    scopus 로고
    • Channel coding: The road to channel capacity
    • June
    • D. J. Costello and G. D. Forney Jr., "Channel coding: The road to channel capacity," Proc. IEEE, vol. 95, pp. 1150-1177, June 2007.
    • (2007) Proc. IEEE , vol.95 , pp. 1150-1177
    • Costello, D.J.1    Forney Jr., G.D.2
  • 14
    • 0005041761 scopus 로고
    • On the number of Reed-Muller code correctable errors
    • R. Krichevskiy, "On the number of Reed-Muller code correctable errors," Dokl. Soviet Acad Sci., no. 191, pp. 541-547, 1970.
    • (1970) Dokl. Soviet Acad Sci. , Issue.191 , pp. 541-547
    • Krichevskiy, R.1
  • 15
    • 0033875035 scopus 로고    scopus 로고
    • Soft-decision majority decoding of Reed-Muller codes
    • Jan.
    • I. Dumer and R. Krichevskiy, "Soft-decision majority decoding of Reed-Muller codes," IEEE Trans. lnform. Theory, vol. 46, pp. 258-264, Jan. 2000.
    • (2000) IEEE Trans. Lnform. Theory , vol.46 , pp. 258-264
    • Dumer, I.1    Krichevskiy, R.2
  • 16
    • 0004199849 scopus 로고
    • RLE 410, Mass. Inst. Tech., RLE, April
    • J. L. Massey, "Threshold Decoding," RLE 410, Mass. Inst. Tech., RLE, April 1963.
    • (1963) Threshold Decoding
    • Massey, J.L.1
  • 17
    • 11144343315 scopus 로고
    • A new multilevel coding method using error correcting codes
    • May
    • H. Imai and S. Hirakawa, "A new multilevel coding method using error correcting codes," IEEE Trans. Inform. Theory, vol. IT-23, pp. 371-377, May 1977.
    • (1977) IEEE Trans. Inform. Theory , vol.IT-23 , pp. 371-377
    • Imai, H.1    Hirakawa, S.2
  • 18
    • 0005140256 scopus 로고
    • Coding of generalized concatenated codes
    • E. L. Blokh and V. V. Zyablov, "Coding of generalized concatenated codes," Probl. Peredachi Inf. vol. 10, no. 3, pp. 45-50, 1974.
    • (1974) Probl. Peredachi Inf. , vol.10 , Issue.3 , pp. 45-50
    • Blokh, E.L.1    Zyablov, V.V.2
  • 19
    • 0042385445 scopus 로고
    • Generalized cascade codes
    • V. A. Zinov'ev, "Generalized cascade codes," Probl. Peredachi Inf., vol. 12, no. 1, pp. 5-15, 1976.
    • (1976) Probl. Peredachi Inf. , vol.12 , Issue.1 , pp. 5-15
    • Zinov'ev, V.A.1
  • 20
    • 0017922440 scopus 로고
    • Efficient maximum likelihood decoding of linear block codes using a trellis
    • Jan.
    • J. Wolf, "Efficient maximum likelihood decoding of linear block codes using a trellis," IEEE Trans. Inform. Theory, vol. 24, pp. 76-80, Jan. 1978.
    • (1978) IEEE Trans. Inform. Theory , vol.24 , pp. 76-80
    • Wolf, J.1
  • 21
    • 0024627773 scopus 로고
    • Multilevel codes and multistage decoding
    • Mar.
    • A. Calderbank, "Multilevel codes and multistage decoding," IEEE Trans. Comm., vol. 37, pp. 222-229, Mar. 1989.
    • (1989) IEEE Trans. Comm. , vol.37 , pp. 222-229
    • Calderbank, A.1
  • 22
    • 0024717378 scopus 로고
    • Closest coset decoding of |u|u + υ| codes
    • Aug.
    • F. Hemmati, "Closest coset decoding of |u|u + υ| codes," IEEE J. Sel. Areas Comm., vol. 7, pp. 982-988, Aug. 1989.
    • (1989) IEEE J. Sel. Areas Comm. , vol.7 , pp. 982-988
    • Hemmati, F.1
  • 23
    • 0029229981 scopus 로고
    • Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
    • Jan.
    • G. Schnabl and M. Bossert, "Soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," IEEE Trans. Inform. Theory, vol. IT-41, pp. 304-308, Jan. 1995.
    • (1995) IEEE Trans. Inform. Theory , vol.IT-41 , pp. 304-308
    • Schnabl, G.1    Bossert, M.2
  • 26
    • 0347804946 scopus 로고    scopus 로고
    • Improved soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
    • R. Lucas, M. Bossert, and A. Dammann, "Improved soft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes," in 2nd. ITG Conf Sour. Chan. Coding, (Aachen, Gennany), pp. 137-142, 1998.
    • (1998) 2nd. ITG Conf Sour. Chan. Coding, (Aachen, Gennany) , pp. 137-142
    • Lucas, R.1    Bossert, M.2    Dammann, A.3
  • 28
    • 77954829412 scopus 로고    scopus 로고
    • Private communication, June
    • F. Didier. Private communication, June 2009.
    • (2009)
    • Didier, F.1
  • 31
    • 33947401071 scopus 로고    scopus 로고
    • Soft-decision decoding of Reed-Muller codes: Recursive lists
    • March
    • I. Dumer and K. Shabunov, "Soft-decision decoding of Reed-Muller codes: recursive lists," IEEE Trans. Inform. Theory, vol. 52, pp. 1260-1266, March 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , pp. 1260-1266
    • Dumer, I.1    Shabunov, K.2
  • 33
    • 33750578195 scopus 로고    scopus 로고
    • Error exponents for recursive decoding of Reed-Muller codes on a binary-symmetric channel
    • Nov.
    • M. Burnashev and I. Dumer, "Error exponents for recursive decoding of Reed-Muller codes on a binary-symmetric channel," IEEE Trans. Inform. Theory, vol. 52, pp. 4880-4891, Nov. 2006.
    • (2006) IEEE Trans. Inform. Theory , vol.52 , pp. 4880-4891
    • Burnashev, M.1    Dumer, I.2
  • 35
    • 69449088011 scopus 로고    scopus 로고
    • Error exponents for two soft-decision decoding algorithms of Reed-Muller codes
    • Sept.
    • M. Burnashev and I. Dumer, "Error exponents for two soft-decision decoding algorithms of Reed-Muller codes," IEEE Trans. lnform. Theory, vol. IT-55, pp. 4108-4118, Sept. 2009.
    • (2009) IEEE Trans. Lnform. Theory , vol.IT-55 , pp. 4108-4118
    • Burnashev, M.1    Dumer, I.2
  • 38
    • 0035246123 scopus 로고    scopus 로고
    • Codes on graphs: Normal realizations
    • Feb.
    • G. D. Forney Jr., "Codes on graphs: Normal realizations," IEEE Trans. lnform. Theory, vol. IT-47, pp. 520-548, Feb. 2001.
    • (2001) IEEE Trans. Lnform. Theory , vol.IT-47 , pp. 520-548
    • Forney Jr., G.D.1
  • 39
    • 46349104863 scopus 로고    scopus 로고
    • A performance comparison of polar codes and Reed-Muller codes
    • June
    • E. Arikan, "A performance comparison of polar codes and Reed-Muller codes," IEEE Comm. Letters, vol. 12, pp. 447-449, June 2008.
    • (2008) IEEE Comm. Letters , vol.12 , pp. 447-449
    • Arikan, E.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.