OpenAlex
Restriction conditions on PL(7, 2) codes (3 ≤ |𝓖 i | ≤ 7)
Work
Year: 2018
Type: article
Abstract: 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 i... more
Cites: 16
Cited by:
Related to: 10
FWCI:
Citation percentile (by year/subfield):
Sustainable Development Goal Quality education
Open Access status: gold
APC paid (est): $1,078