A Deterministic Algorithm for Computing the Weight Distribution of Polar Code

In this work, we present a deterministic algorithm for computing the entire weight distribution of polar codes. As the first step, we derive an efficient recursive procedure to compute the weight distribution that arises in successive cancellation decoding of polar codes along any decoding path. Thi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on information theory Ročník 70; číslo 5; s. 3175 - 3189
Hlavní autori:	Yao, Hanwen, Fazeli, Arman, Vardy, Alexander
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.05.2024 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Affine transformations Algorithms Automorphisms Codes Complexity Complexity theory Computation Decoding decreasing monomial codes Indexes Polar codes Representations Subgroups Symbols Upper bound Upper bounds weight distribution
ISSN:	0018-9448, 1557-9654
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!