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

Lattice codes of low rank are considered for an additive Gaussian noise channel with erasures. The objective is to minimize the error probability with no erasures subject to rate and power constraints while ensuring that the error probability under an allowable erasure pattern is bounded from above. Allowable erasure patterns considered here are those of fixed cardinality. Bounds on performance are derived, and several constructions are investigated for lattices in dimension four. It is shown that the problem can be viewed as a simultaneous ellipsoid packing problem, a generalization of the well known sphere packing problem.

Lattice Erasure Codes of Low Rank with Noise Margins