• DocumentCode
    1779513
  • Title

    On the scaling of the blocklength in some polar coding schemes

  • Author

    Burshtein, David ; Goldin, Darina

  • Author_Institution
    Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel
  • fYear
    2014
  • fDate
    June 29 2014-July 4 2014
  • Firstpage
    126
  • Lastpage
    130
  • Abstract
    Polar code-based source coding is considered for some given code rate and some desired distortion level. The distortion level of a typical quantized source vector is required to be below the desired distortion level. A sufficient polynomial scaling law of the blocklength with respect to the gap between the desired distortion and the distortion-rate function is derived. The results are then used to obtain a polynomial scaling of the blocklength with respect to the gap to capacity for the polar code-based solution of the binary dirty paper problem and for polar write-once memory codes.
  • Keywords
    polynomials; source coding; binary dirty paper problem; distortion-rate function; polar coding; polar write-once memory codes; polynomial scaling; source coding; Decoding; Error probability; Random variables; Source coding; 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.6874808
  • Filename
    6874808