kth.sePublications KTH
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An Efficient Construction of Polarization-Adjusted Convolutional Codes
University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Sichuan, China, Sichuan.
University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Sichuan, China, Sichuan.
University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Sichuan, China, Sichuan.
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Information Science and Engineering.ORCID iD: 0000-0002-5407-0835
2023 (English)In: 2023 IEEE Globecom Workshops, GC Wkshps 2023, Institute of Electrical and Electronics Engineers (IEEE) , 2023, p. 1243-1248Conference paper, Published paper (Refereed)
Abstract [en]

Polarization-adjusted convolutional (PAC) codes have been demonstrated as a significant breakthrough close to the dispersion bound approximation. However, the above superiority is achieved in the context of a configuration of specific code rate thus far, which limits the flexibility in real use. Against this backdrop, this paper introduces a new code construction under the union upper bound (UUB) in accordance with the Hamming weight spectrum. What's more, we combine such construction with Reed-Muller (RM) design rule by efficiently selecting bit-channels on the basis of Hamming distance. Finally, we demonstrate the performance improvement compared to its conventional PAC counterparts.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2023. p. 1243-1248
Keywords [en]
Hamming weight spectrum, list decoding, Polarization-adjusted convolutional codes, union upper bound
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-350257DOI: 10.1109/GCWkshps58843.2023.10464959Scopus ID: 2-s2.0-85190240924OAI: oai:DiVA.org:kth-350257DiVA, id: diva2:1883423
Conference
2023 IEEE Globecom Workshops, GC Wkshps 2023, Kuala Lumpur, Malaysia, Dec 4 2023 - Dec 8 2023
Note

Part of ISBN 9798350370218

QC 20240710

Available from: 2024-07-10 Created: 2024-07-10 Last updated: 2024-07-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Xiao, Ming

Search in DiVA

By author/editor
Xiao, Ming
By organisation
Information Science and Engineering
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 35 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf