English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

A new bound on the error probability of coding with limited code length over additive white Gaussian noise (AWGN) channels is proposed. The developed bound is proved to be universal for two connected encoding ways. On the one hand, we conceive folding the conventional codes, such as Hadamard and binary random ones, in order to adapt shorter code length. On the other hand, we further extend the above folded structure to Gaussian random coding and hence to bound its error probability. Finally, we demonstrate that the bound of the above two constructions can be unified as <inline-formula> <tex-math notation="LaTeX">$\sqrt {\frac {log_{2}e}{2\pi nC}}2^{-n(C/2-R)}$ </tex-math></inline-formula> where <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula> represents the capacity of the AWGN channel, <inline-formula> <tex-math notation="LaTeX">$n$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$R$ </tex-math></inline-formula> stand for the code length and rate, respectively. This theoretical contribution confirms that, in the context of short code length and low rate, the developed two constructions exhibit excellent performance even close to the Shannon bound on AWGN channels.

A New Bound to Error Probability on AWGN Channels: From Folded Coding to Gaussian Random Coding