• DocumentCode
    1780579
  • Title

    Binary successive cancellation decoding of polar codes with Reed-Solomon kernel

  • Author

    Trifonov, Peter

  • Author_Institution
    Distrib. Comput. & Networking Dept., St.-Petersburg State Polytech. Univ., St. Petersburg, Russia
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    2972
  • Lastpage
    2976
  • Abstract
    Reduced complexity implementation of the successive cancellation decoding algorithm for polar codes with Reed-Solomon kernel is presented. The proposed approach is based on the representation of Reed-Solomon codes as Arikan polar codes over F2m with dynamic frozen symbols, and application of list successive cancellation decoding algorithm.
  • Keywords
    Reed-Solomon codes; binary codes; block codes; computational complexity; decoding; error correction codes; linear codes; Arikan polar codes; Reed-Solomon codes; Reed-Solomon kernel; binary successive cancellation decoding algorithm; complexity reduction; dynamic frozen symbols; list successive cancellation decoding algorithm; Complexity theory; Decoding; Heuristic algorithms; Kernel; Reed-Solomon codes; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory (ISIT), 2014 IEEE International Symposium on
  • Conference_Location
    Honolulu, HI
  • Type

    conf

  • DOI
    10.1109/ISIT.2014.6875379
  • Filename
    6875379
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1780579