Coded distributed computing execution time equals erasure-channel error probability for linear codes, with explicit expressions for binary random linear codes and asymptotic optimality for binary codes matching any linear code.
List decoding of polar codes,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IT 2verdicts
UNVERDICTED 2representative citing papers
Bias-enhanced generalized partitioned SCL decoders with list size 8 match SCL performance at list size 16 with 67% less memory and up to 5.4x lower complexity, plus a proof that the added bias steers soft information toward valid codewords.
citing papers explorer
-
Coded Distributed Computing: Performance Limits and Code Designs
Coded distributed computing execution time equals erasure-channel error probability for linear codes, with explicit expressions for binary random linear codes and asymptotic optimality for binary codes matching any linear code.
-
Enhanced Successive Cancellation List Decoder for Long Polar Codes Targeting Air Interface
Bias-enhanced generalized partitioned SCL decoders with list size 8 match SCL performance at list size 16 with 67% less memory and up to 5.4x lower complexity, plus a proof that the added bias steers soft information toward valid codewords.