Restriction conditions on PL(7, 2) codes (3 ≤ |𝓖i| ≤ 7)
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
De Gruyter
2018-04-01
|
| Series: | Open Mathematics |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/math-2018-0027 |