Open AccessThe extension problem for Lee and Euclidean weights
Author(s) -
Philippe Langevin,
Jay A. Wood
Publication year - 2017
Publication title -
journal of algebra combinatorics discrete structures and applications
Language(s) - English
Resource type - Journals
ISSN - 2148-838X
DOI - 10.13069/jacodesmath.284970
Subject(s) - extension (predicate logic) , euclidean geometry , prime (order theory) , combinatorics , mathematics , euclidean distance , discrete mathematics , computer science , geometry , programming language
The extension problem is solved for the Lee and Euclidean weights over three families of rings of the form $\Z/N\Z$: $N=2^{\ell + 1}$, $N=3^{\ell + 1}$, or $N=p=2q+1$ with $p$ and $q$ prime. The extension problem is solved for the Euclidean PSK weight over $\Z/N\Z$ for all $N$.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom