Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Information Theory

arXiv:1805.02813 (cs)
[Submitted on 8 May 2018]

Title:Polarization Weight Family Methods for Polar Code Construction

Authors:Yue Zhou, Rong Li, Huazi Zhang, Hejia Luo, Jun Wang
View PDF
Abstract:Polar codes are the first proven capacity-achieving codes. Recently, they are adopted as the channel coding scheme for 5G due to their superior performance.A polar code for encoding length-K information bits in length-N codeword could be specified by the polar code construction method. Most construction methods define a polar code related to channel parameter set, e.g. designed signal-to-noise ratio. Polarization weight (PW) is a channel-independent approximation method, which estimates the subchannel reliability as a function of its index. In this paper, we generalize the PW method by including higher-order bases or extended bases. The proposed methods have robust performance while preserving the computational and mathematical simplicity as PW.
Subjects: Information Theory (cs.IT)
Cite as: arXiv:1805.02813 [cs.IT]
  (or arXiv:1805.02813v1 [cs.IT] for this version)
  https://doi.org/10.48550/arXiv.1805.02813

Submission history

From: Yue Zhou [view email]
[v1] Tue, 8 May 2018 02:59:11 UTC (942 KB)
Full-text links:

Access Paper:

  • View PDF
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.IT
< prev   |   next >
new | recent | 2018-05
Change to browse by:
cs
math
math.IT

References & Citations

DBLP - CS Bibliography

listing | bibtex
Yue Zhou
Rong Li
Huazi Zhang
Hejia Luo
Jun Wang
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)