1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.IT2020★ 1 cited
Capacity-achieving codes: a review on double transitivity
Kirill Ivanov, Rüdiger L. Urbanke
Recently it was proved that if a linear code is invariant under the action of a doubly transitive permutation group, it achieves the capacity of erasure channel. Therefore, it is o…
cs.IT2020
Partially symmetric monomial codes
Kirill Ivanov, Rüdiger Urbanke
A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known repres…
cs.IT2018
Fast Block Sequential Decoding of Polar Codes
Grigorii Trofimiuk, Nikolay Iakuba, Stanislav Rets +2
A reduced complexity sequential decoding algorithm for polar (sub)codes is described. The proposed approach relies on a decomposition of the polar (sub)code being decoded into a nu…