pith. sign in

Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.IT 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

LLM-Viterbi: Semantic-Aware Decoding for Convolutional Codes

cs.IT · 2026-04-21 · unverdicted · novelty 7.0

An LLM-enhanced Viterbi decoder achieves roughly 1.5 dB extra coding gain in block error rate and over 50% better semantic similarity than conventional Viterbi for constraint-length-3 convolutional codes on AWGN channels.

citing papers explorer

Showing 1 of 1 citing paper.

  • LLM-Viterbi: Semantic-Aware Decoding for Convolutional Codes cs.IT · 2026-04-21 · unverdicted · none · ref 12

    An LLM-enhanced Viterbi decoder achieves roughly 1.5 dB extra coding gain in block error rate and over 50% better semantic similarity than conventional Viterbi for constraint-length-3 convolutional codes on AWGN channels.