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

Construction C<sup>&#x22C6;</sup> was recently introduced as a generalization of the multilevel Construction C (or Forney&#x2019;s code-formula), such that the coded levels may be dependent. Both constructions do not produce a lattice in general, hence the central idea of this paper is to present a 3&#x2212;level lattice Construction C<sup>&#x22C6;</sup> scheme that admits an efficient nearest-neighborhood decoding. In order to achieve this objective, we choose coupled codes for levels 1 and 3, and set the second level code C<inf>2</inf> as an independent linear binary self-dual code, which is known to have a rich mathematical structure among families of linear codes. Our main result states a necessary and sufficient condition for this construction to generate a lattice. We then present examples of efficient lattices and also non-lattice constellations with good packing properties.

Lattice Construction C⋆ from Self-Dual Codes

Lattice Construction C^⋆ from Self-Dual Codes