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

The Golomb-Welch conjecture states that there is no perfect  r -error correcting Lee code of word length  n  over ℤ for  n  ≥ 3 and  r  ≥ 2. This problem has received great attention due to its importance in applications in several areas beyond mathematics and computer sciences. Many results on this subject have been achieved, however the conjecture is only solved for some particular values of  n  and  r , namely: 3 ≤  n  ≤ 5 and  r  ≥ 2;  n  = 6 and  r  = 2. Here we give an important contribution for the case  n  = 7 and  r  = 2, establishing cardinality restrictions on codeword sets.

Restriction conditions on PL(7, 2) codes (3 ≤ |𝓖 i | ≤ 7)