Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Yang, Hengjie"'
Autor:
Yang, Hengjie, Wesel, Richard D.
In this paper, we present new achievability bounds on the maximal achievable rate of variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC) at a fixed message size $M = 2^k$. We provide new bounds for VLSF codes with
Externí odkaz:
http://arxiv.org/abs/2307.14507
Autor:
Sui, Wenhui, Towell, Brendan, Asmani, Ava, Yang, Hengjie, Grissett, Holden, Wesel, Richard D.
Recently, rate-1/n zero-terminated (ZT) and tail-biting (TB) convolutional codes (CCs) with cyclic redundancy check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short blocklengths. This paper d
Externí odkaz:
http://arxiv.org/abs/2212.04064
While constructing polar codes for successive-cancellation decoding can be implemented efficiently by sorting the bit-channels, finding optimal polar codes for cyclic-redundancy-check-aided successive-cancellation list (CA-SCL) decoding in an efficie
Externí odkaz:
http://arxiv.org/abs/2207.01105
Incremental redundancy with ACK/NACK feedback produces a variable-length stop-feedback (VLSF) code constrained to have $m$ decoding times, with an ACK/NACK feedback to the transmitter at each decoding time. This paper focuses on the numerical evaluat
Externí odkaz:
http://arxiv.org/abs/2205.15399
In this paper, we are interested in the performance of a variable-length stop-feedback (VLSF) code with $m$ optimal decoding times for the binary-input additive white Gaussian noise channel. We first develop tight approximations on the tail probabili
Externí odkaz:
http://arxiv.org/abs/2201.11710
This paper explores list decoding of convolutional and polar codes for short messages such as those found in the 5G physical broadcast channel. A cyclic redundancy check (CRC) is used to select a codeword from a list of likely codewords. One example
Externí odkaz:
http://arxiv.org/abs/2201.07843
In this paper, we consider the problem of variable-length coding over the class of memoryless binary asymmetric channels (BACs) with noiseless feedback, including the binary symmetric channel (BSC) as a special case. In 2012, Naghshvar et al. introdu
Externí odkaz:
http://arxiv.org/abs/2111.15042
Recently, rate-$1/\omega$ zero-terminated and tail-biting convolutional codes (ZTCCs and TBCCs) with cyclic-redundancy-check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short blocklengths. Thi
Externí odkaz:
http://arxiv.org/abs/2111.07929
We consider the concatenation of a convolutional code (CC) with an optimized cyclic redundancy check (CRC) code as a promising paradigm for good short blocklength codes. The resulting CRC-aided convolutional code naturally permits the use of serial l
Externí odkaz:
http://arxiv.org/abs/2104.13905
Cyclic redundancy check (CRC) codes combined with convolutional codes yield a powerful concatenated code that can be efficiently decoded using list decoding. To help design such systems, this paper presents an efficient algorithm for identifying the
Externí odkaz:
http://arxiv.org/abs/2001.06029